Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compilers > #1719

ANN: SLK Parser Generator 5.02

Path csiph.com!usenet.blueworldhosting.com!feeder01.blueworldhosting.com!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From "SLK Mail" <slkpg4@gmail.com>
Newsgroups comp.compilers
Subject ANN: SLK Parser Generator 5.02
Date Wed, 29 Jun 2016 14:00:45 -0800
Organization SLK Systems
Lines 24
Sender news@iecc.com
Approved comp.compilers@iecc.com
Message-ID <16-06-013@comp.compilers> (permalink)
Mime-Version 1.0
Content-Type text/plain; charset=iso-8859-15; format=flowed; delsp=yes
Content-Transfer-Encoding 8bit
Injection-Info miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="52706"; mail-complaints-to="abuse@iecc.com"
Keywords tools, available
Posted-Date 30 Jun 2016 05:14:19 EDT
X-submission-address compilers@iecc.com
X-moderator-address compilers-request@iecc.com
X-FAQ-and-archives http://compilers.iecc.com
Xref csiph.com comp.compilers:1719

Show key headers only | View raw


- Now includes support for javascript in addition to C, C++, C#, and java.

- Can create LR(k) and LALR(k) parsers in addition to LL(k).

The extra lookahead is added to the k=1 machine in all cases. For LR this
means the parser falls somewhere between LR(1) and LR(k). The construction
is similar to the way SLR is done, but to the LR(1) machine instead of the
LR(0) one.

The LL(k) parsers are strong LL(k) by definition. Aho and Ullman have
shown that all LL(k) grammars have covering strong LL(k) grammars that are
easily constructed, if somewhat larger. SLK has an option to do this
transparently, resulting in full LL(k) support.

SLK uses well-known table compaction methods to greatly reduce the size of
the parser. In combination with modern RAM size, this makes LR(k) and
LL(k) parsing feasible.

The LR(2) parsers for the extra lookahead problems in LR and LALR grammars
that have come up in this newsgroup over the years seem to work fine. If
anyone has a deterministic grammar that is not handled properly by SLK,
please email me directly.

SLK Parser Generator: http://www.slkpg.com

Back to comp.compilers | Previous | Next | Find similar | Unroll thread


Thread

ANN: SLK Parser Generator 5.02 "SLK Mail" <slkpg4@gmail.com> - 2016-06-29 14:00 -0800

csiph-web