Lecture 7

# Winter 2013 27 uw cse 401 michael ringenburg s aabe a

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: bcde\$ A ::= b \$aAb cde\$ \$aAbc de\$ \$aA de\$ \$aAd e\$ \$aAB e\$ •   Pop the handle oﬀ the stack Winter 2013 UW CSE 401 (Michael Ringenburg) Trace accept 8 B A 3 b 6 e c 9 S ::= aABe 7 A ::= Abc d 5 B ::= d 23 S ::= aABe A ::= Abc | b B ::= d e 8 9 S ::= aABe Stack Input B S\$ \$ abbcde\$ a start A b c 1 2 3 6 7 A ::= Abc \$a bbcde\$ b d \$ab bcde\$ 4 5 \$aA bcde\$ A ::= b B ::= d \$aAb cde\$ \$aAbc de\$ \$aA de\$ \$aAd e\$ \$aAB e\$ •   Repeat all of the states up to the start of the handle 24 Winter 2013 UW CSE 401 (Michael Ringenburg) 12 1/23/13 Trace accept S ::= aABe A ::= Abc | b B ::= d e 8 9 S ::= aABe Stack Input B S\$ \$ abbcde\$ a start A b c 1 2 3 6 7 A ::= Abc \$a bbcde\$ b d \$ab bcde\$ 4 5 \$aA bcde\$ A ::= b B ::= d \$aAb cde\$ \$aAbc de\$ \$aA de\$ \$aAd e\$ \$aAB e\$ •   Then make a single transiTon corresponding to new nonterminal. 25 Winter 2013 UW CSE 401 (Michael Ringenburg) Avoiding DFA Rescanning CSE341: 1: nCSE341: Programming Languages •  ObservaTon Programmingestart the DFA aOer a shiO. o need to r Languages Stay in same state and process next (shiOed) token. Lecture 1 Lecture 1 Course C 2: aOer a reducTon, Mechani...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online