lecture04-Top-Down Parsing I.pptx

Lecture 4 Top-Down Parsing Where We Are Lexical Analysis Syntax Analysis Semantic Analysis IR Generation IR Optimization Code Generation Optimization Source Code Machine Code Review from Last Time Goal of syntax analysis: recover the intended structure of the program. Idea: Use a context-free grammar to describe the programming language. Given a sequence of tokens, look for a parse tree that generates those tokens. Recovering this syntax tree is called parsing. Different Types of Parsing Top-Down Parsing Beginning with the start symbol, try to guess the productions to apply to end up at the users program. Bottom-Up Parsing Beginning with the users program, try to apply productions in reverse to convert the program back into the start symbol Top-Down Parsing int + ( int + int ) T E T E T T E E Challenges in Top-Down Parsing Top-down parsing begins with virtually no information. Begins with just the start symbol, which matches every program How can we know which productions to apply? In general, we cant. There are some grammars for which the best we can do is guess and backtrack if were wrong If we have to guess, how do we do it? Parsing as a Search An idea: treat parsing as a graph search Each node is a sentential form (a string of terminals and nonterminals derivable from the start symbol). There is an edge from node α to node β iff α ? β. Parsing as a Search E T T+E int int + E T+T+E T+T (E) int + T int + (E) (T) (T + E) … … … … int + T + E T + (E) int + int … … … … … E T T+E int int + E T+T+E T+T (E) int + T int + (E) (T) (T + E) … … … … int + T + E T + (E) int + int … … … … … Parsing as a Search Our First Top-Down Algorithm Breadth-First Search Maintain a worklist of sentential forms, nitially just the start symbol S. While the worklist isnt empty: Remove an element from the worklist. If it matches the target string, youre done. Otherwise, for each possible string that can be derived in one step, add that string to the