Talk:Splinter

From Esolang

[edit] A PDA to Splinter compiler

Very interesting work ais523 -- haven't yet had chance to run the program, but I'll try that once I get Perl installed and will also update the specs with this new info. I probably can upload your compiler, too? Funny to see the language gaining more computational power while my back was turned! :) The language was purposefully kept Turing-incomplete since it appeared to be so with its instruction set -- to keep the harmony nothing more was added to gain TCness, but it wasn't especially made to be finite-state automaton -- I only thought it was! It seems a program to increase memory ('stack') infinitely is possible afterall; I thought it wasn't, thus the finite-state machine classification (and also the fact I'm not an expert!). Great work! --Keymaker 19:32, 16 March 2008 (UTC)

My PDA to Splinter compiler is public-domain, although I forgot to state that explicitly, so uploading it is fine. I'm pretty sure it isn't TC, though, because the only place you can store an infinite amount of data is in the program, and that can only be accessed in a LIFO manner, which restricts languages to being push-down automata (Befunge-93 is non-TC for this reason; its only infinite data store is LIFO). I do like the language, though. (Incidentally, I've been wondering how many splinters are needed for PDAness; you can combine any number of splinters that you never change the value of into three (like I do with Z, A and B in the compiler), but I'm not yet sure if it's possible to do the same with splinters that you do assign to.) --ais523 09:59, 17 March 2008 (UTC)