Next:
Unrestricted parsing problem
Up:
A Powerful Grammar Formalism
Previous:
Meta-interpreter
Parsing and generation
Unrestricted parsing problem
Problems with the unrestricted parsing problem
A restricted version of the parsing problem
Other versions of the parsing problem
Restricting equivalence to cyclic labels.
No equivalence for reentrancies.
Thompson's proposal.
Noord G.J.M. van
1998-09-30
