Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #2405
| From | SLK <slkpg4@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | LR(k) Parsing |
| Date | 2019-12-23 10:04 -0500 |
| Organization | Compilers Central |
| Message-ID | <19-12-024@comp.compilers> (permalink) |
The SLK Parser Generator implements a variation on LR(k) that might better be called LR(1+k). SLK adds k-lookahead to the LR(1) machine similar to what SLR does to the LR(0) machine, but k instead of just 1. This is the same algorithm that is also used by SLK to add k-lookahead to LL parsing. With simple table compaction the LR(1) parser is not that big for the grammars I have seen. I would be interested in links to LR/LALR test grammars. SLK Parser Generator: http://www.h8dems.com
Back to comp.compilers | Previous | Next | Find similar
LR(k) Parsing SLK <slkpg4@gmail.com> - 2019-12-23 10:04 -0500
csiph-web