Mid Term Multiple choice questions Part 1 quiz

Is this your test? Login to manage it. If not, you can create an assessment just like it.

1.
1 point
Is the following statement true? The grammar A -> A a | a b (A is the starting symbol; a and b are terminals) is not LL(1).
2.
1 point
If you didn't get any of the answers right before, here is a freebie. All of the answers in this question are right.
3.
1 point
Are multiple choice exams an accurate measure of one's knowledge?
4.
1 point
Grammar A -> A a | b A | Ɛ can recognize (A is the starting symbol ; a and b are tokens)
5.
1 point
Is the following statement true? JAVA is a declarative language.
6.
1 point
Though it is difficult, you are able to start a fire by rapidly rubbing two cool ranch doritos together for a long period of time.
7.
1 point
Is the following statement true? Recursive decenter parsing is a bottom-up passing scheme.
8.
1 point
Is the following statement true? For the same program, the executable file generated with static linking is larger than that with dynamic linking.
9.
1 point
Is the following statement true? In general, an interpreted program runs faster than the compiled version of the same program.
10.
1 point
Is the following statement true? The grammar A -> a A | Ɛ (A is the starting symbol and a is a terminal) recognized the same language as regular expressions a*.
11.
1 point
The undefined variable compiling error in C++ is caught by
12.
1 point
Regular expression (+|-|Ɛ)(a|b|(0|1)*)k(0|1)* can match
13.
1 point
The missing semicolon compiling error in C++ is caught by
14.
1 point
Is Rafael Awesome for making this quiz?
15.
1 point
The type mis-match compiling error in C++ is caught by
16.
1 point
Is the following statement true? The follow set of a nonterminal (N) includes all terminals that can follow N is a sentential form.
17.
1 point
The final output of a compiler front end is typically
18.
1 point
Which of the following is considered one of the first high level languages?
19.
1 point
An attribute grammar has a production and its associated action as below.
E -> E1 + E2 {E.val = E1,.val + E2.val; E1.str = E.str + E2.str;}
Can the grammar be
20.
1 point
Is the following statement true? A string in a language specified by a context free grammar may correspond to more than one parse tree.