Hesselink, W. H., Nov-1992, In : Science of computer programming. 19, 2, p. 171-196 26 p.

Research output: Contribution to journalArticleAcademicpeer-review

Copy link to clipboard


The 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.

Original languageEnglish
Pages (from-to)171-196
Number of pages26
JournalScience of computer programming
Issue number2
Publication statusPublished - Nov-1992

Download statistics

No data available

ID: 3324482