|XPL Analyzer firstname.lastname@example.org (Shoefoot) (2017-06-05)|
|Re: XPL Analyzer email@example.com (Robin Vowels) (2017-06-05)|
|Re: XPL Analyzer firstname.lastname@example.org (George Neuner) (2017-06-05)|
|Re: XPL Analyzer email@example.com (Shoefoot) (2017-06-07)|
|Re: XPL Analyzer firstname.lastname@example.org (mac) (2017-06-08)|
|Re: XPL Analyzer email@example.com (SLK Parser Generator) (2017-06-09)|
|Re: XPL Analyzer firstname.lastname@example.org (George Neuner) (2017-06-09)|
|Re: XPL Analyzer DrDiettrich1@aol.com.dmarc.email (Hans-Peter Diettrich) (2017-06-13)|
|From:||Hans-Peter Diettrich <DrDiettrich1@aol.com.dmarc.email>|
|Date:||Tue, 13 Jun 2017 06:45:55 -0400 (EDT)|
|References:||17-06-002 17-06-006 17-06-007 17-06-011|
|Injection-Info:||miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="49390"; mail-complaints-to="email@example.com"|
|Posted-Date:||13 Jun 2017 06:45:55 EDT|
Am 09.06.2017 um 19:20 schrieb George Neuner:
> In that case, (our moderator) John's suggestion is probably best ...
> if you have the grammar, then plug it into an (LA)LR tool and have it
> generate tables for you.
> I'm not familiar with the book you mentioned, but if a grammar is
> provided [even if not in EBNF], it should be possible to translate it
> for a modern tool.
At least I could find a grammar in BNF, by following the links in
Wikipedia to <teampli.net/XPL/ldindex.html>.
If I had to write an XPL compiler, as an excercise, I'd try to handcraft
an LL(1) top-down parser for it. This approach will give more insight
into "how to write a compiler", than understanding how to use a compiler
generator. Finally that compiler can be rewritten in XPL. Much time will
have to be spent in implementing the system library (Implicit
Declarations) and memory management.
[It does depend on whether you want to write a modern compiler or one that
someone might have written back when XPL was new. -John]
Return to the
Search the comp.compilers archives again.