Publication Date
4-25-1973
Abstract
The problem is to find an efficient algorithm that, given the productions of a context-free grammar G, will discover whether G is LR(k) for given k and if it is build an efficient parser for G . The algorithm is given in Section 8. It is essentially a synthesis of the best parts of Knuth's and DeRemer's algorithms. On simple LR(k) grarranars it yields a result equivalent to DeRemer's algorithm, and like Knuth's algorithm it will work on all LR(k) grammars.
Degree Name
Mathematics
Level of Degree
Doctoral
Department Name
Mathematics & Statistics
First Committee Member (Chair)
Edgar John Gilbert
Second Committee Member
John Wade Ulrich
Third Committee Member
Nancy M. Moler
Language
English
Document Type
Dissertation
Recommended Citation
Sager, Thomas Joshua. "A General LR(k) Parser Building Algorithm." (1973). https://digitalrepository.unm.edu/math_etds/145
