Computer Construction Use any resources you can, the recitation lecture slides, asking each other, and Piazza. Start early, and when the deadline approaches, submit what you have got, no matter how finished. Remember to cite your sources and collaboration partners wherever they have influenced your work. 1 Bottom/up parsing tables Consider the following grammar: E […]
Tag Archives: automaton
Consider the DFA below for the regular expression (yI(xx))y:
Problem 1 You can build a transition table for any deterministic finite automaton. This table has as many rows as states, and as many columns as symbols in the alphabet that the strings are made out of . Entry T[i][x] Shows what the next state would be if you’re in state i and see symbol […]
