Mid Term Multiple choice questions Part 1 quiz

1.

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.

True

False

2.

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

c)None of a or b

a)S-attributed

d)I forgot and will get this question wrong :)

b)L-attributed

3.

1 point

Which of the following is considered one of the first high level languages?

FORTRAN

PASCAL

BASIC

ASSEMBLY

4.

1 point

The final output of a compiler front end is typically

c)intermediate code

b)parse tree

d)All of a, b and c

a)a token

5.

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.

True

False

6.

1 point

The type mis-match compiling error in C++ is caught by

b)syntax analyzer

c)semantic analyzer

d)Not of a, b or c

a)lexical analyzer

7.

1 point

Is Rafael Awesome for making this quiz?

I really don't care bro.

Maybe...I don't want to be mean

No...I got enough points

Yes...free point

8.

1 point

The missing semicolon compiling error in C++ is caught by

a)lexical analyzer

c)semantic analyzer

d)Not a, b or c

b)syntax analyzer

9.

1 point

Regular expression (+|-|Ɛ)(a|b|(0|1)*)k(0|1)* can match

a)-a0101k0

c)+01ka1

b)b0011k

d)None of a, b or c

10.

1 point

The undefined variable compiling error in C++ is caught by

a)lexical analyzer

c)semantic analyzer

b)syntax analyzer

d) Not a, b or c

11.

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*.

True

False

12.

1 point

Is the following statement true? In general, an interpreted program runs faster than the compiled version of the same program.

True

False

13.

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.

True

False

14.

1 point

Is the following statement true? Recursive decenter parsing is a bottom-up passing scheme.

True

False

15.

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.

True, but it is difficult

False, that is impossible Everyone knows that.

16.

1 point

Is the following statement true? JAVA is a declarative language.

True

False

17.

1 point

Grammar A -> A a | b A | Ɛ can recognize (A is the starting symbol ; a and b are tokens)

c)bbaa

a)aabb

b)abab

d)none of a, b or c

18.

1 point

Are multiple choice exams an accurate measure of one's knowledge?

A)Yes

D) All of the Above

C)A And B

B)A And C

19.

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.

B) Cool

A) Sweet

D) Is this a trick question?

C) All of the answers in this question

20.

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).

True

False