Please enable JavaScript.
Coggle requires JavaScript to display documents.
Module 2 (Parse tree (parser types (top down (recursive decent (start with…
Module 2
Parse tree
left-recursive--ambiguity
left recursive elimination
parser types
top down
recursive decent
start with root symbol
expand if input and parse pointer matches
causes mismatch
predictive parsing
recursive
non-recursive
down-up
shift-reduce
Look Ahead LR
Canonical LR
Simple LR
operator precedence
Predictive recursive parser
grammar must be unambigious
steps
1.Remove left recursion
2.create automata for every two non-terminals
avoid inroduced fns and optimize given variables
Write in initial terms
Predictive non-recursive parser
Diagram
Rules
Syntax Analysis
Diagram
CFG
4 tuples
Non-terminals
terminals
start symbol
production rule
Process of deriving string from grammar is called derivation