Compiler

More documents

Recommendations

Info

ANTLR Rule Directives • The ^ in a rule indicates the token used to determine the AST node that is built The logic of the constructor/initializer actually assembles the AST from ASTs of other production elements • The ! In a rule indicates that the token should be ignored for the purpose of ASTs We effectively discard () here after using them to enforce parse structure <strong>Compiler</strong> Abstract Syntax Trees 20
ANTLR Rule Rewriting • More powerfull and flexible than directives Supports new node types (imaginary tokens) compilationUnit : packageDefinition importDefinition* typeDefinition* -> ^(UNIT packageDefinition importDefinition* typeDefinition*) ; <strong>Compiler</strong> Abstract Syntax Trees 21
Page 1 and 2: Compiler The Abstract Syntax Tree (
Page 3 and 4: Phases and Passes • A compiler ph
Page 5 and 6: Multiple Pass Compilation • Speed
Page 7 and 8: Parse Tree vs. AST E + E + T id * T
Page 9 and 10: Enriching ASTs • ASTs can carry l
Page 11 and 12: AST Data Structure • ANTLR provid
Page 13 and 14: BinaryOperatorAST package antlr.exa
Page 15 and 16: LiteralAST public class LiteralAST
Page 17 and 18: Builtin vs. External ASTs • We ar
Page 19: Parse Actions expr: ; mexpr ((PLUS^
Page 23 and 24: Enriching ASTs • ASTs can carry l
Page 25 and 26: External Form • Could produce pre
Page 27 and 28: Eclipse Java Development Tooling (J
Page 29 and 30: Static Semantics • Requirements o
Page 31 and 32: Analyzing Identifiers • Lexical a
Page 33 and 34: Analyzing Identifiers class A{ int
Page 35 and 36: Beyond CFGs Use context-sensitive
Page 37 and 38: Two level Grammars Example: Two lev
Page 39 and 40: Attribute Grammars A set of semanti
Page 41 and 42: Attribute grammars Example attribut
Page 43 and 44: Attribute grammars Semantic rules f
Page 45 and 46: Attribute grammars Semantic rules f
Page 47 and 48: Attribute grammars 1 1 = {(x,
Page 49 and 50: Attribute grammars type_e
Page 51 and 52: Scope rules for names Naming model
Page 53 and 54: Scope rules for names program L; va
Page 55 and 56: Scope rules for names program L; va
Page 57 and 58: Java Symbol Table Uses • which cl
Page 59 and 60: Nesting vs. Ordering Multiple passe
Page 61 and 62: Symbol Table acts like a Stack Comp
Page 63 and 64: Challenges • Liberal rules on var
Page 65 and 66: Overloading • Use the same method

Compiler

Create successful ePaper yourself

Delete template?

Save as template?