{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture 8

# Winter 2013 uw cse 401 michael ringenburg 4 12513

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ::= aABe –  [A ::= . A b c] [A ::= A . b c] [A ::= A b c .] A ::= Abc | b –  [A ::= . b] [A ::= b .] Grossman Dan Grossman Dan B ::= d Fall 2011 –  [B ::= . d] [B ::= d .] 2011 Fall •  A parser DFA state corresponds to a set of items, where each item corresponds to a handle that we might be scanning in that state, as well as how much of the handle we have already read. Winter 2013 UW CSE 401 (Michael Ringenburg) 4 1/25/13 Review: DFA States & Items 1 S ::= .aABe \$ a 2 b S ::= aAB.e B S ::= aA.Be A ::= A.bc B ::= .d A 5 A ::= b. Winter 2013 accept 3 S ::= a.ABe A ::= .Abc A ::= .b 4 8 d b e 9 S ::= aABe. 6 A ::= Ab.c 7 c A ::= Abc. B ::= d. S ::= aABe A ::= Abc | b B ::= d UW CSE 401 (Michael Ringenburg) 5 Items & ShiU/Reduce CSE341: Programming CSE341: Programming Languages Languages •  What do we do if the dot is at the end of an Lecture 1 Lecture 1 item? Course Course Mechanics Mechanics –  We’ve sL Variable Bindings so … een the en;re handle, Bindings ML Variable M –  Reduce by the produc;on! Dan Grossman Fall 2011 Dan Grossman Fall 2011 •  What if the dot is not at the end of...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online