Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Aaron Gray Newsgroups: comp.compilers Subject: Good explanation of Recursive Ascent Parsing wanted Date: Wed, 28 Sep 2022 20:26:49 -0700 (PDT) Organization: Compilers Central Lines: 12 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-09-018@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="67494"; mail-complaints-to="abuse@iecc.com" Keywords: parse, question, LALR, comment Posted-Date: 29 Sep 2022 13:26:52 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:3170 I am after a good explanation of Recursive Ascent Parsing as I wish to implement a parser generator to generate recursive ascent C/C++ code from an LR1 grammar. Regards, Aaron [The Wikipedia article isn't bad and has several promising references, but I wonder if it's worth the effort. RA parsing does what yacc or bison does, but by turning each state into a function. It's supposed to be faster than a table driven parser, but LALR parsers are already so fast, how much faster will it be? Maybe it'll even be slower since there is a lot more code so it's less likely to fit in a CPU cache. -John]