Additional Resources:
Compilers Questions and Answers – Finite Automata and Regular Expressions – 1
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Finite Automata and Regular Expressions”. 1. Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing “m” words, each of length ‘n’. a) m x 2n b) 2mn c) 2(m+n) d) all of the mentioned … Read more
advertisement