Theory of Computing > QUESTIONS & ANSWERS > CS 421 Theory of computing CS421 -HW 2B (based on week4) -- Implementing a Scanner - Programming | C (All)

CS 421 Theory of computing CS421 -HW 2B (based on week4) -- Implementing a Scanner - Programming | California State University, San Marcos

Document Content and Description Below

California State University, San Marcos CS 421 Theory of computing CS421 - Yoshii - HW 2B (based on week4) -- Implementing a Scanner - Programming ========================================== ... ======================= DUE: Week 6 Friday before midnight TOTAL: 30 pts ** Name: ** =================================== DFA Implementation as Functions [15 pts] =================================== ** State of the program: Graded on: Correctness: Comments: Test results: Following the instructions: 1. Submit this sheet 2. Submit the source code file fa.cpp with comments 3. Submit the test results (Test1.txt script or screen dump) from Empress with lines for compiling the file!. Look at the file fa.cpp I have provided. Study it carefully. Run my fa.out with fain_mytoken.txt Change this program (fa.cpp) Note: l can be either a or b d can be either 2 or 3 You should not handle other digits and characters. Word from fain.txt Main calls Scanner calls FA-functions. Requirements: Must test the program with the input file fain.txt containing the following: èTest1.txt =================================== DFA Implementation with a Table [15 pts] =================================== ** State of the program: · Read @instructions first · Using the algorithm in week4a notes, complete td.cpp. · Test using the input files: · Run my sample solution to determine the output format and error messages. [Show More]

Last updated: 7 months ago

Preview 1 out of 2 pages

Buy Now

Instant download

We Accept: