Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Andy Newsgroups: comp.compilers Subject: Parser LL(*) Date: Fri, 18 Mar 2022 11:38:48 -0700 (PDT) Organization: Compilers Central Lines: 6 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-03-039@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" 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 X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:2941 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?