DOCSLIB.ORG

To an Abstract Syntax Tree

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
To an Abstract Syntax Tree School of Computing Science @ Simon Fraser University Parsing Lecture 09: Data Abstraction ++ ➡ Parsing A parser transforms a source program (in concrete • Parsing is the process of translating a sequence of characters (a string) into syntax) toana abstractn abs syntaxtract tree.syn tax tree (AST): program AST −−−−−−→ Parser −−−→ Processor text • Compilers (and some interpreters) analyse abstract syntax trees. • Compilers very well understood • In fact, there exist “compiler compilers” • Example: YACC (yet another compiler compiler) http://dinosaur.compilertools.net/ An Abstraction for Inductive Data Types – p.34/43 Copyright © Bill Havens 1 School of Computing Science @ Simon Fraser University Expression Syntax Extended • An abstract syntax expresses the structure of the concrete syntax without the details. • Example: extended syntax for Scheme expressions • Includes literals (constant numbers) <exp> ::= <number> | <symbol> | (lambda (<symbol>) <exp>) | (<exp> <exp>) • We would define an abstract datatype for this grammar as follows: (define-datatype expression expression? (lit-exp (datum number?)) (var-exp (id symbol?)) (lambda-exp (id symbol?) (body expression?)) (app-exp (rator expression?) (rand expression?))) • Now lets parse sentences in the language specified by the BNF grammar into abstract syntax trees Copyright © Bill Havens 2 School of Computing Science @ Simon Fraser University Parser for Extended Expressions • Here is an example parser for the lambda expression language above: (define parse-expression (lambda (datum) (cond ((number? datum) (lit-exp datum)) ((symbol? datum) (var-exp datum)) ((pair? datum) (if (eqv? (car datum) 'lambda) (lambda-exp (caadr datum) (parse-expression (caddr datum))) (app-exp (parse-expression (car datum)) (parse-expression (cadr datum))))) (else (eopl:error 'parse-expression "Invalid concrete syntax ~s" datum))))) • Fortunately, Schme (read) function does most of the hard work • Identifies tokens in input stream (eg- “(”, “)”, identifiers, strings) • Converts parenthesized structures into dotted-pairs and proper lists Copyright © Bill Havens 3 School of Computing Science @ Simon Fraser University ➡ Example • All we have to do is convert between the lists that read produces into abstract syntax trees (parse-expression ‘(foo x)) (parse-expression 3) (parse-expression ‘(lambda (x) (lambda (y) (cons x y)))) • Let’s see how these work in Dr. Scheme . • Hard to see! • Lets implement an un-parse procedure to take the abstract syntax tree apart • Turns back into concrete Scheme syntax (define unparse-expression (lambda (exp) (cases expression exp (lit-exp (datum) datum) (var-exp (id) id) (lambda-exp (id body) (list 'lambda (list id) (unparse-expression body))) (app-exp (rator rand) (list (unparse-expression rator) (unparse-expression rand)))))) Copyright © Bill Havens 4 School of Computing Science @ Simon Fraser University Environments ➡ Introduction • Consider evaluating the following expression: (+ x 3) • How does the interpreter know the value of variable x ? • Variable bindings stored in a dictionary (aka- symbol table) called an environment • Definition: An environment is a function that maps variable names to their current bindings. - Interpreter: mapping variables to their current values - Compiler: mapping variables to their lexical addresses • We denote an environment by a finite set of bindings, each having the form s➞v. • Example: env = { x ➞ 3, y ➞ (a b c), z ➞ hello } • Environment function can be applied to an argument symbol returning its binding in that enviornment • Example: env(y) = (a b c) • But env(w) = error - undefined variable Copyright © Bill Havens 5 School of Computing Science @ Simon Fraser University Nested Environments • Block structured languages (eg- C, Java, Scheme) allow nested blocks • Example in C: int foo (int z) { int x; float y; if (x < z) { float y = 3.0; ....... } else { print x; ...... }; for (int x = 0; x < z; x++) { print x+y; .........} } • How many different environments are there in this example? • What are the variable bindings in each environment? • Are there any holes in any environment? • Since blocks can be nested, we need to nest environments as well • Each scoping block needs to have its own environment. • The environment of a nested block must to refer to the environments of the enclosing blocks recursively. Copyright © Bill Havens 6 School of Computing Science @ Simon Fraser University Recursive Environments ➡ Introduction • We can think of an environment as extending its enclosing environment. • If you look something up in the environment and don't find it, look in the enclosing environment. • Recursion has to stop, so we need the concept of an empty environment • We can think of an environment then as an inductively-defined type: • The BNF for <environment> <environment> ::= ( ) | ( {<variable>, <value>}* <environment>) • An environment is either empty or its a set of (variable,value) pairs that extend an existing enclosing environment. Copyright © Bill Havens 7 School of Computing Science @ Simon Fraser University Abstract Environments ➡ Basic Idea • An abstract environment requires: 1. a function for creating an empty environment 2. An operator for extending an environment with new bindings 3. An operator for accessing the binding of a variable in an environment • Operator interfaces: ;; returns an empty environment (define empty-env (lambda () ... )) ;; returns an environment that extends env (define extend-env (lambda (vars vals env) ... )) ;; returns the value of the variable "var" in "env" (define apply-env (lambda (env var) ... )) Copyright © Bill Havens 8 School of Computing Science @ Simon Fraser University ➡ Usage (define first-env (empty-env)) (define second-env (extend-env '(a b) '(1 2) first-env) (define third-env (extend-env '(c d b) '(3 4 5) second-env) (apply-env first-env 'a) ; returns an error (apply-env second-env 'a) ; returns 1 (apply-env third-env 'a) ; returns 1 (same "a") (apply-env second-env 'b) ; returns 2 (apply-env third-env 'b) ; returns 5 (different "b") Copyright © Bill Havens 9 School of Computing Science @ Simon Fraser University Implementing Environments ➡ Procedural versus Datatype implementations • Basis for Object-Oriented Programming Language (OOPL) concept • Data is only accessbile via a procedural interface (eg- methods in Java) • Actual implementation of data is hidden by the interface • Implementation can be changed without breaking code ➡ Procedural Implementation • Environments are a function: f(variable) = value. • The empty environment is a function that when called always returns an error! • The method (empty-env) returns an environment with no bindings (define empty-env (lambda () (lambda (sym) (eopl:error 'apply-env "No binding for ~s" sym)))) Copyright © Bill Havens 10 School of Computing Science @ Simon Fraser University ➡ Extending an Environment • An extended environment is also a function which returns a value for a specified variable. • If the variable you're looking for is one defined in that environment, it returns the corresponding value; otherwise, it calls the environment function which it extends • Here is an implementation: (define extend-env (lambda (syms vals env) (lambda (sym) (let ((pos (list-find-position sym syms))) (if (number? pos) (list-ref vals pos) (apply-env env sym)))))) • Note that the bindings are represented as corresponding lists of variables and values • Method extend-env returns a function that when called searches these lists • If desired variable is not found in this environment then extend-env is called recursively on the enclosing environment Copyright © Bill Havens 11 School of Computing Science @ Simon Fraser University ➡ Helper functions • Method (list-find-position sym syms) searches the list of variable names (syms) to find the desired variable (sym) • Returns a zero-based index on success and #f on failure (Scheme convention) (define list-find-position (lambda (sym los) (list-index (lambda (sym1) (eqv? sym1 sym)) los))) • Method (list-index pred ls) is a higher-order function which applies a specified predicate pred to a list ls (define list-index (lambda (pred ls) (cond ((null? ls) #f) ((pred (car ls)) 0) (else (let ((list-index-r (list-index pred (cdr ls)))) (if (number? list-index-r) (+ list-index-r 1) #f)))))) • Comment: what is peculiar about this method implementation? Copyright © Bill Havens 12 School of Computing Science @ Simon Fraser University ➡ Recoding function list-index • Very inefficient implementation when an error is detected • Need an exception thrown instead • Why not use call/cc mechanism? • Reminder: (call/cc <lambda>) calls a function <lambda> of one argument which is the continuation of the call/cc expression. • Applying the continuation function immediately exits from the call/cc • Recoding using call/cc (define list-index (lambda (pred ls) (call/cc (lambda (exit) (list-index1 pred ls exit))))) (define list-index1 (lambda (pred ls exit) (cond ((null? ls) (exit #f)) ((pred (car ls)) 0) (else (+ 1 (list-index1 pred (cdr ls) exit)))))) • Much simpler! But can you improve it further? Use tail recursion! Copyright © Bill Havens 13 School of Computing Science @ Simon Fraser University ➡ Applying a procedural environment • Just call the function on the variable to be accessed (define apply-env (lambda (env sym) (env sym))) • Example: (apply-env (extend-env ’(x z) ’(1 3) (extend-env ’(y z) ’(2 2) (extend-env ’(x y) ’(4 7) (empty-env)))) ’y) • Copyright © Bill Havens 14 School of Computing Science @ Simon Fraser University Datatype Implementation ➡ Overview •
Load more

Recommended publications
  • Derivatives of Parsing Expression Grammars
    Derivatives of Parsing Expression Grammars Aaron Moss Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, Canada [email protected] This paper introduces a new derivative parsing algorithm for recognition of parsing expression gram- mars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm. This work also introduces asymptotic analysis based on inputs with a constant bound on both grammar nesting depth and number of back- tracking choices; derivative and recursive descent parsing are shown to run in linear time and constant space on this useful class of inputs, with both the theoretical bounds and the reasonability of the in- put class validated empirically. This common-case constant memory usage of derivative parsing is an improvement on the linear space required by the packrat algorithm. 1 Introduction Parsing expression grammars (PEGs) are a parsing formalism introduced by Ford [6]. Any LR(k) lan- guage can be represented as a PEG [7], but there are some non-context-free languages that may also be represented as PEGs (e.g. anbncn [7]). Unlike context-free grammars (CFGs), PEGs are unambiguous, admitting no more than one parse tree for any grammar and input. PEGs are a formalization of recursive descent parsers allowing limited backtracking and infinite lookahead; a string in the language of a PEG can be recognized in exponential time and linear space using a recursive descent algorithm, or linear time and space using the memoized packrat algorithm [6]. PEGs are formally defined and these algo- rithms outlined in Section 3.
    [Show full text]
  • Abstract Syntax Trees & Top-Down Parsing
    Abstract Syntax Trees & Top-Down Parsing Review of Parsing • Given a language L(G), a parser consumes a sequence of tokens s and produces a parse tree • Issues: – How do we recognize that s ∈ L(G) ? – A parse tree of s describes how s ∈ L(G) – Ambiguity: more than one parse tree (possible interpretation) for some string s – Error: no parse tree for some string s – How do we construct the parse tree? Compiler Design 1 (2011) 2 Abstract Syntax Trees • So far, a parser traces the derivation of a sequence of tokens • The rest of the compiler needs a structural representation of the program • Abstract syntax trees – Like parse trees but ignore some details – Abbreviated as AST Compiler Design 1 (2011) 3 Abstract Syntax Trees (Cont.) • Consider the grammar E → int | ( E ) | E + E • And the string 5 + (2 + 3) • After lexical analysis (a list of tokens) int5 ‘+’ ‘(‘ int2 ‘+’ int3 ‘)’ • During parsing we build a parse tree … Compiler Design 1 (2011) 4 Example of Parse Tree E • Traces the operation of the parser E + E • Captures the nesting structure • But too much info int5 ( E ) – Parentheses – Single-successor nodes + E E int 2 int3 Compiler Design 1 (2011) 5 Example of Abstract Syntax Tree PLUS PLUS 5 2 3 • Also captures the nesting structure • But abstracts from the concrete syntax a more compact and easier to use • An important data structure in a compiler Compiler Design 1 (2011) 6 Semantic Actions • This is what we’ll use to construct ASTs • Each grammar symbol may have attributes – An attribute is a property of a programming language construct
    [Show full text]
  • AST Indexing: a Near-Constant Time Solution to the Get-Descendants-By-Type Problem Samuel Livingston Kelly Dickinson College
    Dickinson College Dickinson Scholar Student Honors Theses By Year Student Honors Theses 5-18-2014 AST Indexing: A Near-Constant Time Solution to the Get-Descendants-by-Type Problem Samuel Livingston Kelly Dickinson College Follow this and additional works at: http://scholar.dickinson.edu/student_honors Part of the Software Engineering Commons Recommended Citation Kelly, Samuel Livingston, "AST Indexing: A Near-Constant Time Solution to the Get-Descendants-by-Type Problem" (2014). Dickinson College Honors Theses. Paper 147. This Honors Thesis is brought to you for free and open access by Dickinson Scholar. It has been accepted for inclusion by an authorized administrator. For more information, please contact [email protected]. AST Indexing: A Near-Constant Time Solution to the Get-Descendants-by-Type Problem by Sam Kelly Submitted in partial fulfillment of Honors Requirements for the Computer Science Major Dickinson College, 2014 Associate Professor Tim Wahls, Supervisor Associate Professor John MacCormick, Reader Part-Time Instructor Rebecca Wells, Reader April 22, 2014 The Department of Mathematics and Computer Science at Dickinson College hereby accepts this senior honors thesis by Sam Kelly, and awards departmental honors in Computer Science. Tim Wahls (Advisor) Date John MacCormick (Committee Member) Date Rebecca Wells (Committee Member) Date Richard Forrester (Department Chair) Date Department of Mathematics and Computer Science Dickinson College April 2014 ii Abstract AST Indexing: A Near-Constant Time Solution to the Get- Descendants-by-Type Problem by Sam Kelly In this paper we present two novel abstract syntax tree (AST) indexing algorithms that solve the get-descendants-by-type problem in near constant time.
    [Show full text]
  • Syntactic Analysis, Or Parsing, Is the Second Phase of Compilation: the Token File Is Converted to an Abstract Syntax Tree
    Syntactic Analysis Syntactic analysis, or parsing, is the second phase of compilation: The token file is converted to an abstract syntax tree. Analysis Synthesis Compiler Passes of input program of output program (front -end) (back -end) character stream Intermediate Lexical Analysis Code Generation token intermediate stream form Syntactic Analysis Optimization abstract intermediate syntax tree form Semantic Analysis Code Generation annotated target AST language 1 Syntactic Analysis / Parsing • Goal: Convert token stream to abstract syntax tree • Abstract syntax tree (AST): – Captures the structural features of the program – Primary data structure for remainder of analysis • Three Part Plan – Study how context-free grammars specify syntax – Study algorithms for parsing / building ASTs – Study the miniJava Implementation Context-free Grammars • Compromise between – REs, which can’t nest or specify recursive structure – General grammars, too powerful, undecidable • Context-free grammars are a sweet spot – Powerful enough to describe nesting, recursion – Easy to parse; but also allow restrictions for speed • Not perfect – Cannot capture semantics, as in, “variable must be declared,” requiring later semantic pass – Can be ambiguous • EBNF, Extended Backus Naur Form, is popular notation 2 CFG Terminology • Terminals -- alphabet of language defined by CFG • Nonterminals -- symbols defined in terms of terminals and nonterminals • Productions -- rules for how a nonterminal (lhs) is defined in terms of a (possibly empty) sequence of terminals
    [Show full text]
  • Lecture 3: Recursive Descent Limitations, Precedence Climbing
    Lecture 3: Recursive descent limitations, precedence climbing David Hovemeyer September 9, 2020 601.428/628 Compilers and Interpreters Today I Limitations of recursive descent I Precedence climbing I Abstract syntax trees I Supporting parenthesized expressions Before we begin... Assume a context-free struct Node *Parser::parse_A() { grammar has the struct Node *next_tok = lexer_peek(m_lexer); following productions on if (!next_tok) { the nonterminal A: error("Unexpected end of input"); } A → b C A → d E struct Node *a = node_build0(NODE_A); int tag = node_get_tag(next_tok); (A, C, E are if (tag == TOK_b) { nonterminals; b, d are node_add_kid(a, expect(TOK_b)); node_add_kid(a, parse_C()); terminals) } else if (tag == TOK_d) { What is the problem node_add_kid(a, expect(TOK_d)); node_add_kid(a, parse_E()); with the parse function } shown on the right? return a; } Limitations of recursive descent Recall: a better infix expression grammar Grammar (start symbol is A): A → i = A T → T*F A → E T → T/F E → E + T T → F E → E-T F → i E → T F → n Precedence levels: Nonterminal Precedence Meaning Operators Associativity A lowest Assignment = right E Expression + - left T Term * / left F highest Factor No Parsing infix expressions Can we write a recursive descent parser for infix expressions using this grammar? Parsing infix expressions Can we write a recursive descent parser for infix expressions using this grammar? No Left recursion Left-associative operators want to have left-recursive productions, but recursive descent parsers can’t handle left recursion
    [Show full text]
  • Understanding Source Code Evolution Using Abstract Syntax Tree Matching
    Understanding Source Code Evolution Using Abstract Syntax Tree Matching Iulian Neamtiu Jeffrey S. Foster Michael Hicks [email protected] [email protected] [email protected] Department of Computer Science University of Maryland at College Park ABSTRACT so understanding how the type structure of real programs Mining software repositories at the source code level can pro- changes over time can be invaluable for weighing the merits vide a greater understanding of how software evolves. We of DSU implementation choices. Second, we are interested in present a tool for quickly comparing the source code of dif- a kind of “release digest” for explaining changes in a software ferent versions of a C program. The approach is based on release: what functions or variables have changed, where the partial abstract syntax tree matching, and can track sim- hot spots are, whether or not the changes affect certain com- ple changes to global variables, types and functions. These ponents, etc. Typical release notes can be too high level for changes can characterize aspects of software evolution use- developers, and output from diff can be too low level. ful for answering higher level questions. In particular, we To answer these and other software evolution questions, consider how they could be used to inform the design of a we have developed a tool that can quickly tabulate and sum- dynamic software updating system. We report results based marize simple changes to successive versions of C programs on measurements of various versions of popular open source by partially matching their abstract syntax trees. The tool programs, including BIND, OpenSSH, Apache, Vsftpd and identifies the changes, additions, and deletions of global vari- the Linux kernel.
    [Show full text]
  • Parsing with Earley Virtual Machines
    Communication papers of the Federated Conference on DOI: 10.15439/2017F162 Computer Science and Information Systems, pp. 165–173 ISSN 2300-5963 ACSIS, Vol. 13 Parsing with Earley Virtual Machines Audrius Saikˇ unas¯ Institute of Mathematics and Informatics Akademijos 4, LT-08663 Vilnius, Lithuania Email: [email protected] Abstract—Earley parser is a well-known parsing method used EVM is capable of parsing context-free languages with data- to analyse context-free grammars. While being less efficient in dependant constraints. The core idea behind of EVM is to practical contexts than other generalized context-free parsing have two different grammar representations: one is user- algorithms, such as GLR, it is also more general. As such it can be used as a foundation to build more complex parsing algorithms. friendly and used to define grammars, while the other is used We present a new, virtual machine based approach to parsing, internally during parsing. Therefore, we end up with grammars heavily based on the original Earley parser. We present several that specify the languages in a user-friendly way, which are variations of the Earley Virtual Machine, each with increasing then compiled into grammar programs that are executed or feature set. The final version of the Earley Virtual Machine is interpreted by the EVM to match various input sequences. capable of parsing context-free grammars with data-dependant constraints and support grammars with regular right hand sides We present several iterations of EVM: and regular lookahead. • EVM0 that is equivalent to the original Earley parser in We show how to translate grammars into virtual machine it’s capabilities.
    [Show full text]
  • CSCI 742 - Compiler Construction
    CSCI 742 - Compiler Construction Lecture 12 Recursive-Descent Parsers Instructor: Hossein Hojjat February 12, 2018 Recap: Predictive Parsers • Predictive Parser: Top-down parser that looks at the next few tokens and predicts which production to use • Efficient: no need for backtracking, linear parsing time • Predictive parsers accept LL(k) grammars • L means “left-to-right” scan of input • L means leftmost derivation • k means predict based on k tokens of lookahead 1 Implementations Analogous to lexing: Recursive descent parser (manual) • Each non-terminal parsed by a procedure • Call other procedures to parse sub-nonterminals recursively • Typically implemented manually Table-driven parser (automatic) • Push-down automata: essentially a table driven FSA, plus stack to do recursive calls • Typically generated by a tool from a grammar specification 2 Making Grammar LL • Recall the left-recursive grammar: S ! S + E j E E ! num j (E) • Grammar is not LL(k) for any number of k • Left-recursion elimination: rewrite left-recursive productions to right-recursive ones S ! EE0 S ! S + E j E E0 ! +EE0 j E ! num j (E) E ! num j (E) 3 Making Grammar LL • Recall the grammar: S ! E + E j E E ! num j (E) • Grammar is not LL(k) for any number of k • Left-factoring: Factor common prefix E, add new non-terminal E0 for what follows that prefix S ! EE0 S ! E + E j E E0 ! +E j E ! num j (E) E ! num j (E) 4 Parsing with new grammar S ! EE0 E0 ! +E j E ! num j (E) Partly-derived String Lookahead parsed part unparsed part S ( (num)+num ) E E0 ( (num)+num ) (E)
    [Show full text]
  • Syntax and Parsing
    Syntax and Parsing COMS W4115 Prof. Stephen A. Edwards Spring 2002 Columbia University Department of Computer Science Last Time Administrivia Class Project Types of Programming Languages: Imperative, Object-Oriented, Functional, Logic, Dataflow This Time Interpreters and Compilers Structure of a Compiler Lexical Analysis Syntax Parsing The Compilation Process Interpreters Source Program # Input ! Interpreter ! Output Compilers Source Program # Compiler # Input ! Executable Program ! Output Structure of a Compiler # Program Text Lexer # Token Stream Parser # Abstract Syntax Tree Static semantics (type checking) # Annotated AST Translation to intermediate form # Three-address code Code generation # Assembly Code Compiling a Simple Program int gcd(int a, int b) { while (a != b) { if (a > b) a -= b; else b -= a; } return a; } What the Compiler Sees int gcd(int a, int b) { while (a != b) { if (a > b) a -= b; else b -= a; } return a; } i n t sp g c d ( i n t sp a , sp i n t sp b ) nl { nl sp sp w h i l e sp ( a sp ! = sp b ) sp { nl sp sp sp sp i f sp ( a sp > sp b ) sp a sp - = sp b ; nl sp sp sp sp e l s e sp b sp - = sp a ; nl sp sp } nl sp sp r e t u r n sp a ; nl } nl Text file is a sequence of characters After Lexical Analysis int gcd(int a, int b) { while (a != b) { if (a > b) a -= b; else b -= a; } return a; } int gcd ( int a , int b ) – while ( a != b ) – if ( a > b ) a -= b ; else b -= a ; ˝ return a ; ˝ A stream of tokens.
    [Show full text]
  • CS164: Introduction to Programming Languages and Compilers Fall 2010 1
    Parsers, Grammars and Logic Programming Ras Bodik, Thibaud Hottelier, James Ide UC Berkeley CS164: Introduction to Programming Languages and Compilers Fall 2010 1 Administrativia Project regrades: submit a patch to your solution small penalty assessed -- a function of patch size PA extra credit for bugs in solutions, starter kits, handouts we keep track of bugs you find on the Errata wiki page How to obtain a solution to a programming assignment see staff for hardcopy Office hours today: “HW3 clinic” for today, room change to 511 extended hours: 4 to 5:30 2 PA2 feedback: How to desugar Program in source language (text) Program in source language (AST) Program in core language (AST) 3 PA2 feedback: How to specify desugaring Desugaring is a tree-to-tree transformation. you translate abstract syntax to abstract syntax But it’s easier to specify the transformation in text using concrete syntax, as a text-to-text transformation Example: while (E) { StmtList } --> _WhileFun_(lambda(){E}, lambda(){StmtList}) 4 Outline (hidden slide) Goal of the lecture: • Languages vs grammars (a language can be described by many grammars) • CYK and Earley parsers and their complexity (Earley is needed for HW4) • Prolog (backtracking), Datalog (forward evaluation = dynamic programming) Grammars: • generation vs. recognition • random generator and its dual, oracular recognizer (show their symmetry) • Write the backtracking recognizer nicely with amb Parse tree: • result of parsing is parse tree • the oracle reconstructs the parse tree • add tree reconstruction with amb Prolog refresher • Example 1: something cool • Example 2: something with negation Switch to prolog • rewrite amb recognizer (no parse tree reconstruction) in prolog • rewrite amb recognizer (with parse tree reconstruction) in prolog • analyze running time complexity (2^n) Change this algorithm to obtain CYK once evaluated as Datalog • facts should be parse(nonterminal, startPosition, endPosition) • now ask if the evaluation needs to be exponential.
    [Show full text]
  • Top-Down Parsing
    CS 4120 Introduction to Compilers Andrew Myers Cornell University Lecture 5: Top-down parsing 5 Feb 2016 Outline • More on writing CFGs • Top-down parsing • LL(1) grammars • Transforming a grammar into LL form • Recursive-descent parsing - parsing made simple CS 4120 Introduction to Compilers 2 Where we are Source code (character stream) Lexical analysis Token stream if ( b == 0 ) a = b ; Syntactic Analysis if Parsing/build AST == = ; Abstract syntax tree (AST) b 0 a b Semantic Analysis CS 4120 Introduction to Compilers 3 Review of CFGs • Context-free grammars can describe programming-language syntax • Power of CFG needed to handle common PL constructs (e.g., parens) • String is in language of a grammar if derivation from start symbol to string • Ambiguous grammars a problem CS 4120 Introduction to Compilers 4 Top-down Parsing • Grammars for top-down parsing • Implementing a top-down parser (recursive descent parser) • Generating an abstract syntax tree CS 4120 Introduction to Compilers 5 Parsing Top-down S → E + S | E E → num | ( S ) Goal: construct a leftmost derivation of string while reading in token stream Partly-derived String Lookahead parsed part unparsed part S ( (1+2+(3+4))+5 → E+S ( (1+2+(3+4))+5 → (S) +S 1 (1+2+(3+4))+5 → (E+S)+S 1 (1+2+(3+4))+5 → (1+S)+S 2 (1+2+(3+4))+5 → (1+E+S)+S 2 (1+2+(3+4))+5 → (1+2+S)+S 2 (1+2+(3+4))+5 → (1+2+E)+S ( (1+2+(3+4))+5 → (1+2+(S))+S 3 (1+2+(3+4))+5 → (1+2+(E+S))+S 3 (1+2+(3+4))+5 6 Problem S → E + S | E E → num | ( S ) • Want to decide which production to apply based on next symbol (1) S
    [Show full text]
  • Codegenassem.Java) Lexical Analysis (Scanning)
    Undergraduate Compilers Review Structure of a Typical Interpreter Compiler Analysis Synthesis Announcements character stream – Send me email if you have set up a group. Include account names for group. lexical analysis IR code generation – Each project is 10% of grade tokens “words” IR Today syntactic analysis optimization – Outline of planned topics for course AST “sentences” IR – Overall structure of a compiler semantic analysis code generation – Lexical analysis (scanning) – Syntactic analysis (parsing) annotated AST target language interpreter CS553 Lecture Undergrad Compilers Review 2 CS553 Lecture Undergrad Compilers Review 3 Structure of the MiniJava Compiler (CodeGenAssem.java) Lexical Analysis (Scanning) Analysis Synthesis Break character stream into tokens (“words”) character stream – Tokens, lexemes, and patterns – Lexical analyzers are usually automatically generated from patterns Lexer lexical analysis IR code generation Translate (regular expressions) (e.g., lex) tokens “words” IRT Tree/ Examples Parser.parse() syntactic analysis instruction selection Mips/Codegen token lexeme(s) pattern AST “sentences” Assem const const const Project 4 if if if BuildSymTable semantic analysis optimization relation <,<=,=,!=,... < | <= | = | != | ... CheckTypes identifier foo,index [a-zA-Z_]+[a-zA-Z0-9_]* Assem CodeGenAssem number 3.14159,570 [0-9]+ | [0-9]*.[0-9]+ string “hi”, “mom” “.*” AST and symbol table code generation minijava.node/ MIPS const pi := 3.14159 ⇒ const, identifier(pi), assign,number(3.14159) SymTable/ CS553 Lecture Undergrad
    [Show full text]