ON THE REDUCTION OF LR(K) PARSERS
The problem of reducing the number of states in a given LR(k) parser is treated from the standpoint of static merging, introducing a well-defined reduction of the parser. In addition, a locally optimal reduction is presented as a method for reducing the number of states.
- Publisher
- ELSEVIER SCIENCE BV
- Issue Date
- 1993-10
- Language
- English
- Article Type
- Article
- Keywords
GRAMMARS
- Citation
INFORMATION PROCESSING LETTERS, v.47, no.5, pp.245 - 251
- ISSN
- 0020-0190
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.