Generalized Overlap Resolvable Grammars, Languages, and Parsers
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).
2 pages matching mixed strategy in this book
Results 1-2 of 2
What people are saying - Write a review
We haven't found any reviews in the usual places.
1-productions ACT.PARAM ALGOL algorithm h allow apply ARITH.EXP BDSP bits BOOL.PRIM BRC grammars Chapter characters classes of grammars computer word COND.STAT condition 1 overlaps configuration constructed context checking context free grammar Corollary decision procedure defined definition denote DeRemer's derived described DESIG.EXP deterministic languages Domolki dpda driver matrices e-moves e-rules error recovery ghost GOR grammars grammar classes grammar G handle Hence implies infinite loop input stream integers lemma length LR(l LR(o mixed strategy modified non-terminals Note output overlaps are resolvable parse parser phrase match production Proof proper subset pushdown pushdown automaton right context right resolvability rithm rule sentential form Set i:=i SF(G SIMP.ARITH.EXP SLR(l SMSP space requirements stack step STEPHEN WISE string substring terminal characters theorem 19 thesis transition table transitive closure triple UNCOND.STAT undefined unresolvable overlaps vector vocabulary