flat assembler
Message board for the users of flat assembler.
![]() |
Author |
|
Pinecone_
This is based on my Befunge interpreter.
Bugs:
I mostly posted this here to add a link to this in my Esoteric Programming Challenges topic
|
|||||||||||
![]() |
|
rugxulo
Dumb question, but can't you (or someone, I mean) write an interpreter for Brainf*** in Befunge??
![]() |
|||
![]() |
|
Pinecone_
rugxulo wrote: Dumb question, but can't you (or someone, I mean) write an interpreter for Brainf*** in Befunge?? Smile ![]() |
|||
![]() |
|
TmX
|
|||
![]() |
|
Pinecone_
That should be pretty simple. I'll make one later tonight, submit it to this board and add whitespace to the list of esoteric languages in the Esoteric Programming Challenges! thread.
Edit: Probably not tonight. I have a fair few assignments piled up that i need to do. Ill get around to it sometime. |
|||
![]() |
|
revolution
MHajduk wrote: I guess that it would be easier to write Befunge interpreter in Brainf*ck. |
|||
![]() |
|
Fanael
revolution wrote: Hmm, how would you emulate the Befunge "?" operator in brainfuck? |
|||
![]() |
|
revolution
But Turing-completeness has nothing to do with non-deterministic outputs. PRNGs are only possible with non-deterministic inputs as seeds. The only source of input for brainfuck is the keyboard. So that makes it impossible to implement a PRNG automatically like Befunge can.
|
|||
![]() |
|
rugxulo
Nthern wrote:
It seems to work on simple programs, but longer ones (quine.b) seem to be either really slow or hang on my DJGPP compile. Whatever. If anybody tests this (or writes their own, preferably NOT in B98), I'm interested in your comments. P.S. The 80x25 limit might be a hindrance (e.g. 30000 cell size in Brainf***), but even an interpreter for smaller (500 byte) programs might still be interesting. (Or maybe just put it on the stack, who knows.) |
|||
![]() |
|
< Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2020, Tomasz Grysztar. Also on GitHub, YouTube, Twitter.
Website powered by rwasa.