For
<term>
non-LR grammars
</term>
the
<term>
time-complexity
</term>
of our
<term>
parser
</term>
is cubic if the
<term>
functions
</term>
that constitute the
<term>
parser
</term>
are implemented as
<term>
memo-functions
</term>
, i.e.
<term>
functions
</term>
that memorize the results of previous invocations .
#21484Fornon-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations.
other,4-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>
.
#21571Extended 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.
