Question: Regular expressions are used to represent which language?
Options
A : Recursive language
B : Context free language
C : Regular language
D : All of the mentioned
Click to view Correct Answer
Previous ||
Compilers Test more questions
Decidable can be taken as a synonym to:
If L is a recursive language, L’ is:
A language L is said to be Turing decidable if:
Which one of the following is a top-down parser?
The language accepted by a turing machine is called ____________
_________ is a raw material sent to and processed in....
Material that leaves a process unit that is the downstream....
A ___________ stream is a stream bled off from the....
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Compilers Symbol Table Organization 1
Compilers Syntax Directed Definitions Translations 1
Compilers Syntax Directed Definitions Translations 2
Compilers Three Address Statements 1