Journal of the ACM (JACM)
Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing
Journal of the ACM (JACM)
Communications of the ACM
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
EULER: a generalization of ALGOL and it formal definition: Part 1
Communications of the ACM
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Extended precedence languages, bounded right context languages, anti deterministic languages
SWAT '70 Proceedings of the 11th Annual Symposium on Switching and Automata Theory (swat 1970)
| Hi-index | 0.00 |
The class of GOR grammars admits @e-rules and includes a grammar for every deterministic language. Its simple decision procedure yields pairs of problematic phrases, if the grammar is not GOR, or tables used to drive a deterministic pushdown parser very rapidly. The parsing algorithm, based on one of Domolki, takes advantage of the architecture of binary computers by computing state transitions quickly with logical 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 any time, if the original grammar and relations need to be modified.