Alfred Aho - WikipediaAlfred Vaino Aho born August 9, is a Canadian computer scientist best known for his work on programming languages , compilers , and related algorithms, and his textbooks on the art and science of computer programming. Aho received a B. He served as chair of the department from to , and again in the spring of In his PhD thesis Aho created indexed grammars and the nested-stack automaton as vehicles for extending the power of context-free languages , but retaining many of their decidability and closure properties. Indexed grammars have been used [ by whom?
4.5- Implementing Finite Automata - Compilers and interpreters 11m56s
The Theory of Parsing, Translation and Compiling: v. 1
Acta Informatica. A new method for transforming grammars into equivalent LL k grammars is studied. The applicability of the transformation is characterized by defining a subclass of LR k grammars, called predictive LR k grammars, with the property that a grammar is predictive LR k if and only if the corresponding transformed grammar is LL k. Furthermore, it is shown that deterministic bottom-up parsing of a predictive LR k grammar can be done by the LL k parser of the transformed grammar. The class of predictive LR k grammars strictly includes the class of LC k grammars the grammars that can be parsed deterministically in the left-corner manner. Thus our transformation is more powerful than the one previously available, which transforms LC k grammars into LL k form. Unable to display preview.
Formal Language a Practical Introduction by Adam Brooks Webber. The Theory and Practice of Compiler Writing. Theory of Parsing Translation And Compiling Alfred v Aho Jeffrey D Ullman Vol 1.
ft books of the year