The formalism of attribute grammars is a powerful tool for specifying the static semantics of programming languages,and attribute evaluation provides an effective approach to automatic semantic analysis.The author pre...The formalism of attribute grammars is a powerful tool for specifying the static semantics of programming languages,and attribute evaluation provides an effective approach to automatic semantic analysis.The author previously proposed a time-optimal algorithm for incremental evaluation of ordered attribute grammars.In this paper,three improvements are suggested upon the algorithm so that it not only allows multiple subtree replacements,but also cancels three auxiliary tables required before,For experimental purposes,the improved algorithm has been implemented in Pascal on Motorola展开更多
In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordi...In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well. For experimental purposes, the algorithm has been implemented by simulation展开更多
文摘The formalism of attribute grammars is a powerful tool for specifying the static semantics of programming languages,and attribute evaluation provides an effective approach to automatic semantic analysis.The author previously proposed a time-optimal algorithm for incremental evaluation of ordered attribute grammars.In this paper,three improvements are suggested upon the algorithm so that it not only allows multiple subtree replacements,but also cancels three auxiliary tables required before,For experimental purposes,the improved algorithm has been implemented in Pascal on Motorola
文摘In this paper, a parallel algorithm is presented for the evaluation of ordered attribute grammars. The parallelism is achieved by constructing the so-called parallel visit sequences and accordingly augmenting the ordinary evaluation driver as well. For experimental purposes, the algorithm has been implemented by simulation