Aho–Ullman algorithms for parsing
E672059
Aho–Ullman algorithms for parsing are foundational compiler-construction techniques that efficiently analyze and translate the syntactic structure of programming languages based on formal grammar theory.
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
compiler-construction technique
ⓘ
context-free grammar parsing method ⓘ parsing algorithm family ⓘ |
| application |
semantic analysis frameworks in compilers
ⓘ
syntax-directed translation ⓘ |
| author |
Alfred V. Aho
NERFINISHED
ⓘ
Jeffrey D. Ullman NERFINISHED ⓘ |
| basedOn |
context-free grammars
ⓘ
formal grammar theory ⓘ |
| coreConcept |
FIRST sets
ⓘ
FOLLOW sets ⓘ items and item sets in LR parsing ⓘ parse tables ⓘ recursive-descent parsing ⓘ shift-reduce parsing ⓘ viable prefixes ⓘ |
| describedIn |
"Compilers: Principles, Techniques, and Tools"
NERFINISHED
ⓘ
"Principles of Compiler Design" NERFINISHED ⓘ |
| enables |
detection of syntax errors
ⓘ
translation of source programs to intermediate representations ⓘ |
| field |
compiler construction
ⓘ
formal language theory ⓘ programming languages ⓘ |
| goal |
construction of efficient parsers
ⓘ
syntax analysis of programming languages ⓘ |
| hasType |
LL parsing algorithms
ⓘ
LR parsing algorithms ⓘ bottom-up parsing algorithms ⓘ operator-precedence parsing algorithms ⓘ predictive parsing algorithms ⓘ top-down parsing algorithms ⓘ |
| impact | standardized teaching of parsing in computer science curricula ⓘ |
| influenced |
design of many programming language compilers
ⓘ
modern parser generators such as Bison ⓘ modern parser generators such as Yacc ⓘ |
| namedAfter |
Alfred V. Aho
NERFINISHED
ⓘ
Jeffrey D. Ullman NERFINISHED ⓘ |
| property |
aim to run in linear time in the length of the input
ⓘ
designed for deterministic context-free languages ⓘ |
| relatedTo |
attribute grammars
ⓘ
finite automata for lexical analysis ⓘ pushdown automata for parsing ⓘ syntax-directed definitions ⓘ |
| timePeriod | 1970s ⓘ |
| usedIn |
compiler front ends
ⓘ
interpreters ⓘ parser generators ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.