Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Christopher F Clark Newsgroups: comp.compilers Subject: Re: A simpler way to tokenize and parse? Date: Sun, 26 Mar 2023 17:11:14 +0300 Organization: Compilers Central Sender: johnl@iecc.com Approved: comp.compilers@iecc.com Message-ID: <23-03-025@comp.compilers> MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="3915"; mail-complaints-to="abuse@iecc.com" Keywords: syntax Posted-Date: 26 Mar 2023 20:50:23 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Thread-Topic: Re: A simpler way to tokenize and parse? Xref: csiph.com comp.compilers:3427 If I recall correctly, at one time, PCCTS and it’s related tool Sorcerer used an S-expression-like representation for ASTs, including an equivelnt to CAR and CDR, whose names I don’t recall but they were something like “down” and “right”. More recent versions of ANTLR don't expose that as far at I have seen, preferring to use a Visitor pattern for traversals.