Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!news-out.readnews.com!news-xxxfer.readnews.com!news.misty.com!news.iecc.com!.POSTED!nerds-end
From: Borneq <borneq.spamtrap@gmail.com>
Newsgroups: comp.compilers
Subject: How implement walking over attribute grammar graph?
Date: Tue, 7 May 2013 10:28:11 -0400 (EDT)
Organization: Compilers Central
Lines: 6
Sender: johnl@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <13-05-002@comp.compilers>
NNTP-Posting-Host: news.iecc.com
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: leila.iecc.com 1367936891 64641 64.57.183.58 (7 May 2013 14:28:11 GMT)
X-Complaints-To: abuse@iecc.com
NNTP-Posting-Date: Tue, 7 May 2013 14:28:11 +0000 (UTC)
Keywords: books, question
Posted-Date: 07 May 2013 10:28:11 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:888

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?