AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correctness proof. For non-LR(0) grammars its time complexity is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz (1988), Barnard and Cordy (1988) and Roberts (1988)
Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various at...
For the deterministic context-free languages, we compare the space and time complexity of their LR(1...
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
A purely functional implementation of LR(0) parsers is given, together with a simple correctness pro...
AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correct...
Abstract. We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived f...
An overview is given of recursive ascent parsing, a new functional implementation technique for pars...
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classi...
Abstract. This paper describes a purely functional implementation of LR parsing. We formally derive ...
Parser combinators elegantly and concisely model generalised LL parsers in a purely functional langu...
Tomita's Generalized LR(1) parser (GLR) algorithm for CF grammars runs in a linear time onLR(1) gram...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
AbstractLR parsers have long been known as being an efficient algorithm for recognizing deterministi...
AbstractAn overview is given of recursive ascent parsing, a new functional implementation technique ...
Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various at...
For the deterministic context-free languages, we compare the space and time complexity of their LR(1...
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
A purely functional implementation of LR(0) parsers is given, together with a simple correctness pro...
AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correct...
Abstract. We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived f...
An overview is given of recursive ascent parsing, a new functional implementation technique for pars...
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classi...
Abstract. This paper describes a purely functional implementation of LR parsing. We formally derive ...
Parser combinators elegantly and concisely model generalised LL parsers in a purely functional langu...
Tomita's Generalized LR(1) parser (GLR) algorithm for CF grammars runs in a linear time onLR(1) gram...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
AbstractLR parsers have long been known as being an efficient algorithm for recognizing deterministi...
AbstractAn overview is given of recursive ascent parsing, a new functional implementation technique ...
Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various at...
For the deterministic context-free languages, we compare the space and time complexity of their LR(1...
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
DOI
Add to ORKG