|LR(k) Parsing email@example.com (SLK) (2019-12-23)|
|Date:||Mon, 23 Dec 2019 10:04:41 -0500|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="59451"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||23 Dec 2019 21:53:27 EST|
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
SLK Parser Generator: http://www.h8dems.com
Return to the
Search the comp.compilers archives again.