Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #3427
| From | Christopher F Clark <christopher.f.clark@compiler-resources.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: A simpler way to tokenize and parse? |
| Date | 2023-03-26 17:11 +0300 |
| Organization | Compilers Central |
| Message-ID | <23-03-025@comp.compilers> (permalink) |
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.
Back to comp.compilers | Previous | Next — Next in thread | Find similar
Re: A simpler way to tokenize and parse? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2023-03-26 17:11 +0300 Re: A simpler way to tokenize and parse? Thomas Koenig <tkoenig@netcologne.de> - 2023-03-27 05:08 +0000
csiph-web