Generalized Overlap Resolvable Grammars, Languages, and Parsers.
Technical summary rept.,
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Pagination or Media Count:
The class of GOR grammars admits epsilon-rules and includes a grammar for every deterministic language. It simple decision procedure yields pairs of problematic phrases, if the grammar is not GOR, or tables used to build a deterministic push-down parser vary rapidly. The parsing algorithm, based on one of Domolki, takes advantage of the architecture of binary computers by computing state transitions quickly with ligical operations. These computations can be used by a pre-processor to compute an actual state transition table, if desired. This extension yields a still faster parser which can be abandoned temporarily by reverting to the state computing algorithm at anytime, if the original grammer and relations need to be modified. Author
- Computer Programming and Software