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