A minimal LL(1) parser generator ?

Andy <borucki.andrzej@gmail.com>
Sat, 21 Dec 2019 19:07:55 -0800 (PST)

          From comp.compilers

Related articles
A minimal LL(1) parser generator ? borucki.andrzej@gmail.com (Andy) (2019-12-21)
Re: A minimal LL(1) parser generator ? arnold@skeeve.com (2019-12-22)
Re: A minimal LL(1) parser generator ? anton@mips.complang.tuwien.ac.at (2019-12-26)
Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2019-12-29)
Re: A minimal LL(1) parser generator ? gaztoast@gmail.com (2019-12-31)
Re: A minimal LL(1) parser generator ? anton@mips.complang.tuwien.ac.at (2019-12-31)
Re: A minimal LL(1) parser generator ? carlglassberg@gmail.com (2020-01-01)
[13 later articles]
| List of all articles for this month |

From: Andy <borucki.andrzej@gmail.com>
Newsgroups: comp.compilers
Date: Sat, 21 Dec 2019 19:07:55 -0800 (PST)
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="72013"; mail-complaints-to="abuse@iecc.com"
Keywords: LL(1), question
Posted-Date: 22 Dec 2019 11:17:42 EST

ANTLR has even LL(*) but is too complicated. I am searching maximal
simple and elegant generator which generates function call like
written by hand.


Temporary goal: must be very simple, bacause this will not parse
program/document, just only strings with my definitions of (augmented)
regular expressions. I can write it by hand, but generator minimizes
possibility making mistake and systemztize work.



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.