This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ǫ-transitions, you don’t need to use Thompson’s construction. (b) Give a regular expression for the literals; you may use ǫ . (c) Modula-3 based literals have the form base digits (e.g., 2_11111111 , 8_377 , 16_FF , 255 are equivalent integer literals). Why is the Modula-3 form preferable to the assembler form introduced here, from the standpoint of a compiler (or assembler) writer? 2. (a) Using Thompson’s construction, construct an NFA that recognizes the same language as defined by the following regular expression: (1 * 01 * 0) * 1 * (b) Using the subset construction, convert the NFA into a DFA. Optimize the resulting DFA by merging any equivalent states. 1...
View Full Document
This note was uploaded on 12/31/2011 for the course CSC 4351 taught by Professor Baumgartner,g during the Fall '08 term at LSU.
- Fall '08