#21460A purely functional implementation ofLR-parsers is given, together with a simple correctness proof.
other,13-1-E91-1012,ak
</term>
is given , together with a simple
<term>
correctness proof
</term>
. It is presented as a
<term>
generalization
#21468A purely functional implementation of LR-parsers is given, together with a simplecorrectness proof.
other,5-2-E91-1012,ak
proof
</term>
. It is presented as a
<term>
generalization
</term>
of the
<term>
recursive descent parser
#21476It is presented as ageneralization of the recursive descent parser.
tech,8-2-E91-1012,ak
a
<term>
generalization
</term>
of the
<term>
recursive descent parser
</term>
. For
<term>
non-LR grammars
</term>
#21479It is presented as a generalization of therecursive descent parser.
tech,1-3-E91-1012,ak
recursive descent parser
</term>
. For
<term>
non-LR grammars
</term>
the
<term>
time-complexity
</term>
of
#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-3-E91-1012,ak
For
<term>
non-LR grammars
</term>
the
<term>
time-complexity
</term>
of our
<term>
parser
</term>
is cubic
#21487For non-LR grammars thetime-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
<term>
time-complexity
</term>
of our
<term>
parser
</term>
is cubic if the
<term>
functions
</term>
#21490For non-LR grammars the time-complexity of ourparser 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,12-3-E91-1012,ak
<term>
parser
</term>
is cubic if the
<term>
functions
</term>
that constitute the
<term>
parser
</term>
#21495For non-LR grammars the time-complexity of our parser is cubic if thefunctions 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
functions
</term>
that constitute the
<term>
parser
</term>
are implemented as
<term>
memo-functions
#21499For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute theparser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations.
other,20-3-E91-1012,ak
<term>
parser
</term>
are implemented as
<term>
memo-functions
</term>
, i.e.
<term>
functions
</term>
that
#21503For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented asmemo-functions, i.e. functions that memorize the results of previous invocations.
other,23-3-E91-1012,ak
as
<term>
memo-functions
</term>
, i.e.
<term>
functions
</term>
that memorize the results of previous
#21506For 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,0-4-E91-1012,ak
results of previous invocations .
<term>
Memo-functions
</term>
also facilitate a simple way to construct
#21515For 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.Memo-functions also facilitate a simple way to construct a very compact representation of the parse forest.
other,11-4-E91-1012,ak
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 compactrepresentation of the parse forest.
other,14-4-E91-1012,ak
compact
<term>
representation
</term>
of the
<term>
parse forest
</term>
. For
<term>
LR ( 0 ) grammars
</term>
#21529Memo-functions also facilitate a simple way to construct a very compact representation of theparse forest.
other,1-5-E91-1012,ak
the
<term>
parse forest
</term>
. For
<term>
LR ( 0 ) grammars
</term>
, our
<term>
algorithm
</term>
is closely
#21533ForLR ( 0 ) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\].
tech,8-5-E91-1012,ak
<term>
LR ( 0 ) grammars
</term>
, our
<term>
algorithm
</term>
is closely related to the
<term>
recursive
#21540For LR(0) grammars, ouralgorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\].
tech,14-5-E91-1012,ak
algorithm
</term>
is closely related to the
<term>
recursive ascent parsers
</term>
recently discovered by Kruseman Aretz
#21546For LR(0) grammars, our algorithm is closely related to therecursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\].
other,0-6-E91-1012,ak
\ [ 1 \ ] and Roberts \ [ 2 \ ] .
<term>
Extended CF grammars
</term>
(
<term>
grammars
</term>
with
<term>
regular
#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.
other,4-6-E91-1012,ak
<term>
Extended CF grammars
</term>
(
<term>
grammars
</term>
with
<term>
regular expressions
</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.
tech,6-6-E91-1012,ak
grammars
</term>
(
<term>
grammars
</term>
with
<term>
regular expressions
</term>
at the right hand side ) can be parsed
#21573Extended 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.