Parser LL(*)

Andy <borucki.andrzej@gmail.com>
Fri, 18 Mar 2022 11:38:48 -0700 (PDT)

          From comp.compilers
Related articles
Parser LL(*) borucki.andrzej@gmail.com (Andy) (2022-03-18)
Re: Parser LL(*) gneuner2@comcast.net (George Neuner) (2022-03-19)
LL(*) christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-03-20)
Re: LL(*) gneuner2@comcast.net (George Neuner) (2022-03-21)
| List of all articles for this month |
From: Andy <borucki.andrzej@gmail.com>
Newsgroups: comp.compilers
Date: Fri, 18 Mar 2022 11:38:48 -0700 (PDT)
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="61594"; mail-complaints-to="abuse@iecc.com"
Keywords: LL(1), question
Posted-Date: 18 Mar 2022 14:46:18 EDT

Many language construction needs lookahead depth known in runtime, for example difference between function declarations and definitions.
LL(*) is described in https://www.antlr.org/papers/allstar-techreport.pdf.
This is only one place about LL(*) info?
If is the simplest idea make LL(1) with several conflicts and first speculative trying all paths, and backtrack?
How do speedup it with cache?
How make speculative trying in function calls?

Post a followup to this message

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