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 \ ] .
<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>
.
#21567For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\]. 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.