Your skill will accomplish what the force of many cannot |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
I did some studying on non-determinism. An example of a non-deterministic algorithm is mergesort.
It is guarantees that the results will the sorted, but the relative ordering of baz and bar is not specified. Therefore, mergesort is non-deterministic. Let's see if we can replicate the same situation with the parser. The goals of Perl's parser include the production of functions.
The parser produces a function that calls foo(), bar() and baz(), but the order in which the calls are organized is not specified. Therefore, the parser is non-deterministic. I don't know what that means wrt Perl's parsability, since I don't know I don't know how that's defined. In reply to Re^4: Unparseability is A Good Thing
by ikegami
|
|