(A) parser generator scheme for attributed grammars

Abstract

In this thesis, attributed grammars are discussed as the parsable syntactic specification that can handle the context-sensitive aspects of the syntax of programming languages. The formal definition of attributed grammars and the notion of attributed derivations are examined. A parsable class of attributed grammars, called ALL(K), is identified, and algorithms are presented for testing ALL(K) property and for generating the ALL(K) parser developed as an extension of the LL(K) technique.