3 ms·
On the contrary, it requires a Turing machine to parse fully.
by howerj 8y ago
On the contrary, it requires a Turing machine to parse fully.
- lisper 8y agoWhich is typically implemented in Forth. (The same is true of Common Lisp. But that in and of itself does not make it hard to parse.)
- howerj 8y agoYes it does, in fact it is pretty much the canonical definition of something being hard to parse. Given an arbitrary Forth program you can't even tell if the parser will terminate. Granted, the non-fixed grammar starts off simple, but it can be made to be arbitrarily complex.
- lisper 8y agoIMHO "hard to parse" means that writing a parser that works requires a lot of effort. In the case of both Forth and Lisp, that is not the case. Writing a working parser for either language is an elementary exercise, notwithstanding that the syntax can be arbitrarily extended by the user.