Compilers Questions and Answers – Finite Automata – 1
This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Finite Automata – 1”. 1. A language L from a grammar G = { VN, Σ, P, S} is? a) Set of symbols over VN b) Set of symbols over Σ c) Set of symbols over P d) Set of symbols over S … Read more