Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #888
| From | Borneq <borneq.spamtrap@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | How implement walking over attribute grammar graph? |
| Date | 2013-05-07 10:28 -0400 |
| Organization | Compilers Central |
| Message-ID | <13-05-002@comp.compilers> (permalink) |
In "Compiler Construction" (Waite,Goos) in section 8.2 is algorithm: - evaluate element R(p) - move to son-node i (i=1..n) - move to father-node How to implement?
Back to comp.compilers | Previous | Next | Find similar | Unroll thread
How implement walking over attribute grammar graph? Borneq <borneq.spamtrap@gmail.com> - 2013-05-07 10:28 -0400
csiph-web