AbstractThe LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program development and parsing theory. The program development uses invariants and the new concept of weakest angelic precondition. The parsing theory involved relates rightmost derivability to three other transitive relations on strings. The usual stack of item sets and the finite automaton appear in an optimisation of the abstract algorithm
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
PhD ThesisA method of syntactic analysis, termed LA(m)LR(k), is discussed theoretically. Knuth's LR...
A new version of LR(k) parsing is introduced here. The basic idea is to define the LR(k) parser in a...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
textabstractIn parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In...
A new version of LR(k) parsing is introduced here. The basic idea is to define the LR(k) parser in a...
Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by ...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
In dieser Arbeit befassen wir uns mit zwei Problemen aus dem Themenfeld der Konstruktion sogenannter...
The theory of LL(k) parsing of context-free grammars is developed as a dual of the theory of LR(k) p...
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
PhD ThesisA method of syntactic analysis, termed LA(m)LR(k), is discussed theoretically. Knuth's LR...
A new version of LR(k) parsing is introduced here. The basic idea is to define the LR(k) parser in a...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
The LR(k)-parsing algorithm is derived, i.e., presented and proved as an interplay between program d...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
textabstractIn parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In...
A new version of LR(k) parsing is introduced here. The basic idea is to define the LR(k) parser in a...
Certain techniques for modifying LR(k) parsing tables to decrease their size have been developed by ...
AbstractThe algorithm we present here generates finite-state automata for potentially unbounded exam...
In dieser Arbeit befassen wir uns mit zwei Problemen aus dem Themenfeld der Konstruktion sogenannter...
The theory of LL(k) parsing of context-free grammars is developed as a dual of the theory of LR(k) p...
The problem is to find an efficient algorithm that, given the productions of a context-free grammar ...
PhD ThesisA method of syntactic analysis, termed LA(m)LR(k), is discussed theoretically. Knuth's LR...
A new version of LR(k) parsing is introduced here. The basic idea is to define the LR(k) parser in a...
DOI
Add to ORKG