Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #2341
| From | luser droog <mijoryx@yahoo.com.dmarc.email> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Examples/resources for the "middle end" of a compiler? |
| Date | 2019-06-20 14:47 -0700 |
| Organization | Compilers Central |
| Message-ID | <19-06-012@comp.compilers> (permalink) |
I have worked up a scanner and parser for a primitive version of C, but I have hit a block on how to extend the code further to make a fully working compiler. I have a lisp-like list containing sublists and token objects. What does a nice tree traversal code look like? Any thoughts or suggestions? I can add annotations in the parser to insert things to search for. Perhaps my problem is vague criteria. I kind of want to make a code formatting tool first rather than a compiler, so I really want some kind of middle-end processing that makes formatting easier. I am ignoring the rats nest issue of the preprocessor entirely for the present. To put it succinctly, are there any good examples of lisp code for processing a C-like grammar that handles the middle end nicely? Or any related stuff I should look at? tia
Back to comp.compilers | Previous | Next | Find similar | Unroll thread
Examples/resources for the "middle end" of a compiler? luser droog <mijoryx@yahoo.com.dmarc.email> - 2019-06-20 14:47 -0700
csiph-web