Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Pxem
#1
Have you ever heard of "Pxem"? It's an esoteric programming language for joke created by "ぬこ"(nuko) in 2008. With the language you can make programs with zero-bytes files.

It actually recognizes filename as a code. That is how it works.

For example, if filename is Hello, world!.pxe, it outputs:Hello, world.

Also, ak.-akbuzz.-ak4.-akfizz.-ak2.-1.p05.-.tab.z01.-.c.m.+.c.t05.-.%.w.s01.-.m03.-.%.W.s.m.nak.-.p00.-.c.c.c.a.wak.-fizz.p00.-.c.c.a.a.w01.-.m03.-.%.w.sak.-buzz.p00.-.c.c.a.wak.-fizzbuzz.p00.-.c.a.a.md2.-02.-.!.a.d.pxe outputs Fizzbuzz.

But unfortunately the author's site is down for some reasons, so no one can get the compiler anymore....
Additionally, there are little information about it, so it's really difficult to get anything related to it.... What a tragedy....

List of very few sources I managed to find:
And finally, I have never found any information about it written in English.
Reply
#2
And this is how it works, I think.

video above Wrote:p:Outputs entire of stack from top to bottom as a string.
o:Pops stack to output as a character-code.
n:Pops stack to output as a numeric.
|(or l?):Inputs one byte from STDIN to stack.
_:Inputs signed integer value from STDIN to stack.
c:Pops stack, copies it to double, and stacks them.
s:Pops stack. Popped value will be thrown away.
v:Reverses contents of stack.
f:Recognizes the contents of the file as a string to stack.
e:Recognizes the contents of the files as a Pxem code to execute on another process.
r:Pops stack. If it is 0, makes a random value up to the value(I think) to stack.
w:Pops stack. If it is 0, skips to next to the corresponding stop command.
(space):Pops stack twice to compare the value of them.
x:If first-popped byte is not as little as second one, skips to next to the corresponding stop command.
y:If first-popped byte is not as large as second one, skips to next to the corresponding stop command.
z:If they are equal, skips to next to the corresponding stop command.
a:This is the stop command. Goes back to the corresponding commands out of w, x, y, or z.
t:Pops stack to substitute to temporal region.
m:Stacks the value on temporal region.
d:Ends executing.
+, -, !:Pops stack twice to stack the sum/difference(it will be positive integer)/product of them.
$:Pops stack twice to stack the quotient of them.
%:Pops stack twice to stack the modulo of them.
Reply
#3
There are tons of esoteric programming languages, created mostly as a joke. Have fun: https://esolangs.org/wiki/Main_Page
If you need to contact me for any reason, or if you have any questions, concerns, problems or requests, message me here or email me at aaaaaa123456789@acidch.at.

This forum has been around for (loading...)
Reply
#4
(2018-04-04 08:39:42)aaaaaa123456789 Wrote: There are tons of esoteric programming languages, created mostly as a joke. Have fun: https://esolangs.org/wiki/Main_Page
It seems the article about Pxem doesn't exist. So I need to make one.

And I found the archived page!

But seriously, why did the author close their own webpage? And why didn't they make English instructions?
Reply
#5
Perhaps they didn't feel like maintaining an old webpage...
If you need to contact me for any reason, or if you have any questions, concerns, problems or requests, message me here or email me at aaaaaa123456789@acidch.at.

This forum has been around for (loading...)
Reply
#6
Bump. And the article is done! I hope you make out the language's specification. Also there seems to be a person who tried making the interpreter with Ruby.
Reply
#7
I'm trying to make the interpreter in C++ since I'm used to C++ the most.
Reply
#8
Real programmers use COW as a programming language.
Reply
#9
Good news everyone!

THIS, "wktk/rpxem" WORKS PROPERLY!
There might be the source-code of original interpreter....
Reply
#10
Bump.

Did you already see that original interpreter is back?

The author says that

Q&A Sections Wrote:Q.Does it have a command that swaps top two elements of stack?
A.Unfortunately, it doesn't. I hadn't noticed it until they pointed out, that the feature was mandatory for languages working with stack but it's not Turing-complete due to its crappy features. IDK.

I thought the language should be expanded. These are my ideas that MIGHT make Pxem Turing-complete.

Specifications
Original Pxem has
  • a stack which stores integer values
  • a temporary region which stores an integer value

I think the temporary region should be extended into an array.

New Commands
Will these commands make it more convenient to make new programs?
  • You capitalize outputting commands(.p, .o, .n), the interpreter puts '\n' at the end.
  • .# ignores the string immediately before the command. As a result, it's easier to put comments on source.
  • .0, .1, .2, and so on, stores 0, 1, 2, and so on, not '0', '1', '2', and so on, as immediate values. Now it's more convenient.
  • You use .A, not .a, the contents between it and corresponding .w, .x, .y, or .z will be if condition, not loop.
  • Since temporary region got changed, commands about those will be re-specified. .t and .m will now be commands for where pointer points out. Also new commands to operate the pointer needs to be made.
  • Finally, there will also be: loop for specified times, three conditions depends on two values, and so on.

I might have to implement those by myself....
Reply




Users browsing this thread: 1 Guest(s)