Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various attempts have been made to enhance the power and flexibility of the LR method, without losing the property of linear time parsing, or introducing inordinately large constant factors which prohibit practicality. In this paper, we survey the particular line of this work which adds power through allowing noncanonical operation of the LR parser --- reducing non-leftmost phrases. We show that for some natural extensions, the use of noncanonical parsing is beneficial in enlarging the class of accepted grammars or languages, while for others, the class of resulting grammars constitute a non-recursive set. The original goal of this work was to investig...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
AbstractWe present a practical technique for computing lookahead for an LR(0) parser, that progressi...
AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correct...
This paper addresses the longstanding problem of the recognition lim-itations of classical LALR(1) p...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
AbstractThe precision of right-hand context covering for conflict resolution is improved over previo...
AbstractA new general context-free parsing algorithm is presented which runs in linear time and spac...
AbstractA new general context-free parsing algorithm is presented which runs in linear time and spac...
textabstractIn parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In...
Regular right part (RRP) grammars differ from context free (CF) grammars by virtue of the fact that ...
A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms i...
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classi...
Abstract. We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived f...
AbstractLR parsers have long been known as being an efficient algorithm for recognizing deterministi...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
AbstractWe present a practical technique for computing lookahead for an LR(0) parser, that progressi...
AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correct...
This paper addresses the longstanding problem of the recognition lim-itations of classical LALR(1) p...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
AbstractThe precision of right-hand context covering for conflict resolution is improved over previo...
AbstractA new general context-free parsing algorithm is presented which runs in linear time and spac...
AbstractA new general context-free parsing algorithm is presented which runs in linear time and spac...
textabstractIn parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In...
Regular right part (RRP) grammars differ from context free (CF) grammars by virtue of the fact that ...
A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms i...
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classi...
Abstract. We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived f...
AbstractLR parsers have long been known as being an efficient algorithm for recognizing deterministi...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
AbstractWe present a practical technique for computing lookahead for an LR(0) parser, that progressi...
AbstractA purely functional implementation of LR(0) parsers is given, together with a simple correct...