It is presented as a
<term>
generalization
</term>
of the
<term>
recursive descent parser
</term>
.
#21476It is presented as a generalization of the recursive descent parser.
other,4-3-E91-1012,ak
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 .
#21487For non-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.
tech,7-3-E91-1012,ak
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 .
#21490For non-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.
tech,16-3-E91-1012,ak
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 .
#21499For non-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,11-4-E91-1012,ak
<term>
Memo-functions
</term>
also facilitate a simple way to construct a very compact
<term>
representation
</term>
of the
<term>
parse forest
</term>
.
#21526Memo-functions also facilitate a simple way to construct a very compact representation of the parse forest.
tech,8-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 \ ] .
#21540For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\].
tech,23-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>
.
#21590Extended 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.