Guest User

Untitled

a guest
Dec 15th, 2018
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.26 KB | None | 0 0
  1. In this class, an emulator is software that duplicates (or emulates) the functions of a first computer system (the guest) in a different second computer system (the host), so that the emulated behavior exactly replicates the behavior of the guest.
  2.  
  3. You are to design and write an emulator for state-table defined finite state automata using breadth-first tracing semantics. There are two inputs: the program written as a state-table and a line of printable ASCII characters that represent input strings.
  4.  
  5. INPUT STRINGS. An input string is a single line to standard input that is terminated by a new line. Only printable characters are allowed; unprintable characters are treated as a newline character. Reserve the poundrel ('#') for the empty string.
  6.  
  7. STATE TABLES. The input programs are written using the five column notation we used from the beginning, with the columns separated by tabs. State tables will also be read from STDIN.
  8.  
  9. CONTROL LINES. There are three control lines: %BP, %EP, %ES. The beginning of a table is a line with just %BP on it. This is followed by the table; the table is terminated with %EP. The test strings for this program follow; the test is terminated by %ET. Call the lines between %BP and %ET a packet; an input can contain more than one packet.
Add Comment
Please, Sign In to add comment