Re: Branched gotos was: Re: A minimal LL(1) parser generator ?

Ben Hanson <jamin.hanson@googlemail.com>
Tue, 7 Jan 2020 11:32:20 -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 ? rockbrentwood@gmail.com (2020-01-04)
Branched gotos was: Re: A minimal LL(1) parser generator ? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2020-01-06)
Re: Branched gotos was: Re: A minimal LL(1) parser generator ? jamin.hanson@googlemail.com (Ben Hanson) (2020-01-07)
| List of all articles for this month |
From: Ben Hanson <jamin.hanson@googlemail.com>
Newsgroups: comp.compilers
Date: Tue, 7 Jan 2020 11:32:20 -0800 (PST)
Organization: Compilers Central
References: 19-12-016 20-01-005 20-01-011
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="93595"; mail-complaints-to="abuse@iecc.com"
Keywords: code
Posted-Date: 07 Jan 2020 14:48:47 EST
In-Reply-To: 20-01-011

On Monday, 6 January 2020 14:39:06 UTC, Christopher F Clark wrote:
> (I am currently considering making the machine deal with
> captures and backreferences. That is simply some more actions in the
> assembly language.)


I can confirm that this works well. Adding the ability to search using a grammar rather than simply match also opens up a whole other world of possibilities.


Regards,


Ben

Post a followup to this message

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