Related articles |
---|
How implement walking over attribute grammar graph? borneq.spamtrap@gmail.com (Borneq) (2013-05-07) |
From: | Borneq <borneq.spamtrap@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 7 May 2013 10:28:11 -0400 (EDT) |
Organization: | Compilers Central |
Keywords: | books, question |
Posted-Date: | 07 May 2013 10:28:11 EDT |
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?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.