Winter 2013 uw cse 401 michael ringenburg 20 10 11413

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: – may get this for free… •  If needed, run DFA un:l no more transi:ons. If not in a final state, backtrack to last seen final state. Not always necessary. Winter 2013 UW CSE 401 (Michael Ringenburg) 18 9 1/14/13 Punng it together Chat finds t Languages •  A CSE341:aProgramminghe next token eLanguages scanner is DFA tSE341: Programming ach :me it is called (and advances the input pointer to the token’s end). Lecture 1 Lecture 1 •  Every “final” sourse Mechanics returns) a token. e ourse C tate of a DFA Cmits ( Mechanics ML Variable Bindings •  For example: Variable Bindings ML == becomes <equal> (not <assign> <assign>) Dan Grossman D ( becomes an Grossman <leqParen> Fall 2011 Fall 2011 private becomes <private> •  Compiler writer (you!) choose the token names •  Also, there may be addi:onal data associated with tokens … \r\n might count lines; all tokens might include line #; integer literals include value; etc. Winter 2013 UW CSE 401 (Michael Ringenburg) 19 DFA => Code, by Hand CSE341: Programming CSE341: Programming Languages Languages •  Op:on 1: One procedure per DFA state –  Reads in a character,...
View Full Document

Ask a homework question - tutors are online