SLR(1) and LALR(1) parsing for unrestricted grammars |
| |
Authors: | Lawrence A. Harris |
| |
Affiliation: | (1) Department of Mathematics, University of Kentucky, College of Arts and Sciences, Patterson Office Tower, 40506-0027 Lexington, Ky, USA |
| |
Abstract: | Summary Simple LR(1) and lookahead LR(1) phrase structure grammars are defined and corresponding deterministic two-pushdown automata which parse all sentences are given. These grammars include a wide variety of grammars for non context-free languages. A given phrase structure grammar is one of these types if the parse table for the associated automaton has no multiple entries. A technique for construction of this parse table is given which in the lookahead case involves elimination of inverses in a grammar for lookahead strings for LR(0) items and computation of first sets for strings of symbols in the given grammar. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|