Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compilers > #2941

Parser LL(*)

Path csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From Andy <borucki.andrzej@gmail.com>
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> (permalink)
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

Show key headers only | View raw


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?

Back to comp.compilers | Previous | NextNext in thread | Find similar


Thread

Parser LL(*) Andy <borucki.andrzej@gmail.com> - 2022-03-18 11:38 -0700
  Re: Parser LL(*) George Neuner <gneuner2@comcast.net> - 2022-03-19 21:14 -0400
    LL(*) Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-03-20 20:05 +0200
      Re: LL(*) George Neuner <gneuner2@comcast.net> - 2022-03-21 15:47 -0400

csiph-web