Home > Marketing Management 101 > Quizzes > Theory of Computation and Compiler Design Practice Test
Theory of Computation and Compiler Design Practice Test
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “Which of the following describes a handle (as applicable to LR-parsing) appropri…”

Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation with respect to simple machines, referred to as automata. Automata* enables scientists to understand how machines compute the functions and solve problems.
Theory of Computation is very important in compiler design as it helps in writing efficient algorithms, which help make efficient compiler construcion.

Theory of Computation and Compiler Design Practice Test
Time left 00:00
1 Questions

1. Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?