Re: A minimal LL(1) parser generator ?

Lightweight and interesting, this Gray parser-generator.


Example:


Gray's meta notation uses a postix operator "&&" for "separator list".


"&&" seems particularly elegant and interesting:


If Gray: "a b &&" ---> EBNF: "a { b a }"


then I assume:


"a b && c &&" ---> "a { b a } { c a }"


and so on ...


Further "a b && b && ..." ===> "a b &&"


??? Is my understanding correct?


Carl
----


On Thursday, December 26, 2019 at 9:12:41 AM UTC-8, Anton Ertl wrote:
> Andy <borucki.andrzej@gmail.com> writes:
> >ANTLR has even LL(*) but is too complicated. I am searching maximal
> >simple and elegant generator which generates function call like
> >written by hand.
>
> Sounds like you want a generator that generates a recursive-descent
> parser. A while ago I compared a number of parser generators
> [ertl99ef], and among those that generate recursive-descent parsers
> the shortest one by far was Gray
> <http://www.complang.tuwien.ac.at/forth/Gray5.zip>. Whether you
> consider it simple and elegant is for you to decide.
>
> @InProceedings{ertl99ef,
> author = {M. Anton Ertl},
> title = {Is {Forth} Code Compact? {A} Case Study},
> booktitle = {EuroForth'99 Conference Proceedings},
> year = {1999},
> address = {St. Petersburg, Russia},
> url = {http://www.complang.tuwien.ac.at/papers/ertl99ef.ps.gz},

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