2 ms·
you can't parse any non-regular language on any given computer It is nice how the author completely ignored LALR parsers[1], peg parsers[2], and so on. [1] ht
by DanielRibeiro 15y ago
you can't parse any non-regular language on any given computer
It is nice how the author completely ignored LALR parsers[1], peg parsers[2], and so on.
[1] http://en.wikipedia.org/wiki/LALR_parser http://en.wikipedia.org/wiki/LALR_parser
[2] http://en.wikipedia.org/wiki/Parsing_expression_grammar http://en.wikipedia.org/wiki/Parsing_expression_grammar
- deleted 15y ago[deleted]
- thurn 15y agoYou can only imperfectly emulate anything more than a regular language in a finite reality (since a pushdown automaton has an infinite stack). A PC is just a big DFA.