Re: A simpler way to tokenize and parse?

Christopher F Clark <christopher.f.clark@compiler-resources.com>
Sun, 26 Mar 2023 17:11:14 +0300

          From comp.compilers
Related articles
A simpler way to tokenize and parse? costello@mitre.org (Roger L Costello) (2023-03-24)
Re: A simpler way to tokenize and parse? mal@wyrd.be (Lieven Marchand) (2023-03-25)
Re: A simpler way to tokenize and parse? 864-117-4973@kylheku.com (Kaz Kylheku) (2023-03-26)
Re: A simpler way to tokenize and parse? spibou@gmail.com (Spiros Bousbouras) (2023-03-26)
Re: A simpler way to tokenize and parse? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2023-03-26)
Re: A simpler way to tokenize and parse? 864-117-4973@kylheku.com (Kaz Kylheku) (2023-03-26)
Re: A simpler way to tokenize and parse? tkoenig@netcologne.de (Thomas Koenig) (2023-03-27)
| List of all articles for this month |
From: Christopher F Clark <christopher.f.clark@compiler-resources.com>
Newsgroups: comp.compilers
Date: Sun, 26 Mar 2023 17:11:14 +0300
Organization: Compilers Central
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
Thread-Topic: Re: A simpler way to tokenize and parse?

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.

Post a followup to this message

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