| tech,14-5-E91-1012,ak | For <term> LR ( 0 ) grammars </term> , our <term> algorithm </term> is closely related to the <term> recursive ascent parsers </term> recently discovered by Kruseman Aretz \ [ 1 \ ] and Roberts \ [ 2 \ ] . | #21546 For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\]. | |
| other,25-6-E91-1012,ak | <term> Extended CF grammars </term> ( <term> grammars </term> with <term> regular expressions </term> at the right hand side ) can be parsed with a simple modification of the <term> LR-parser </term> for <term> normal CF grammars </term> . | #21592 Extended CF grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of the LR-parser for normal CF grammars . |
