S s s lecture 1 s l1 lecture l l

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: end of this item [S’ ::= S$.], we accept rather than reduce. –  Ques;on: What language does this modified grammar generate? Winter 2013 22 UW CSE 401 (Michael Ringenburg) Start of LR Parse CSE341: Programming CSE341: Programming Languages Languages:= S $ 0. S’ : •  Lecture 1 Lecture 1 At the beginning of tCourse Mechanics he parse: Course Mechanics ML Variable Bindings –  Stack is Lmpty M e Variable Bindings 1. 2. 3. 4. S ::= ( L ) S ::= x L ::= S L ::= L , S –  Input is the right hand side of S’, i.e., S $ Dan Grossman Dan Grossman Fall 2011 –  Ini;al configura;on is [S’ ::= . S $] Fall 2011 –  But, since posi;on is just before S, we are also just before anything that can be derived from S Winter 2013 UW CSE 401 (Michael Ringenburg) 23 1/25/13 Ini;al state CSE341: Programming CSE341: Programming Languages Languages:= S $ 0. S’ : S’ ::= . S Lecture 1 startLecture 1 $ S ::=Course Mechanics Mechanics .(L) Course completion S ::= L Variable Bindings Bindings .x ML Variable M 1. 2. 3. 4. S...
View Full Document

Ask a homework question - tutors are online