We identify a new class of non-circular attribute grammars, called the multi-plan attribute grammars, for which static evaluation plans can be computed. The class of multi-plan attribute grammars is larger than all currently known classes of non-circular attribute grammars with static evaluation plans. The decision procedure and the procedure for computing evaluation plans take essentially polynomial time under a new, more practical criterion (but the procedures still take exponential time based on the traditional criterion). The multi-plan attribute grammars lead to a new way to classify well-defined attribute grammars into a hierarchy based on the look-ahead behavior of the evaluators. Our work confirms a result of Riis and Skyum, which says that all well-defined attribute grammars can be evaluated with static evaluators.
|Number of pages||10|
|State||Published - 1 Dec 1997|
|Event||Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97 - Hong Kong, Hong Kong|
Duration: 2 Dec 1997 → 5 Dec 1997
|Conference||Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97|
|City||Hong Kong, Hong Kong|
|Period||2/12/97 → 5/12/97|