{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Credit hal perkins wrote this dfa and code winter

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: aCourse Mechanics c:on ML Variable Bindings •  Go to next state ML Variable Bindings •  •  Accept token, go to start state •  Error Dan Grossman Dan Grossman Fall 2011 Pros Fall 2011 –  Convenient – just feed it the token regular expressions –  Exactly matches specifica:on you give it, if tool correct •  Cons –  “Magic” –  Some:mes language constructs don’t map perfectly to FA model –  Not efficient Winter 2013 UW CSE 401 (Michael Ringenburg) 21 DFA => code, automa:c CSE341: Programming CSE341: Programming Languages Languages •  Op:on 2: use tool to generate direct- coded scanner –  Transi:ons embedded in the Lode, using condi:onal Lecture 1 c ecture 1 statements, loops, possibly goto Mechanics Course Course Mechanics ML Variable Bindings •  Pros ML Variable Bindings –  Convenient – just feed it the REs Dan Grossman Dan pecifica:on –  Exactly matches sGrossman you give it, if tool correct Fall 2011 Fall table –  More efficient than 2011 driven...
View Full Document

{[ snackBarMessage ]}