Correct Mark 100 out of 100 Flag question Question text blank challenged the

Correct mark 100 out of 100 flag question question

This preview shows page 32 - 38 out of 63 pages.

Question 9CorrectMark 1.00 out of 1.00Flag questionQuestion text
Image of page 32
blank challenged the mathematical community to find an infallible, mechanical method for constructing and checking truth of mathematical statements. DavidHilbertAlanTuringLeibniz’sDreamGeorgeBooleAlonzoChurch Feedback Your answer is correct. Question 10CorrectMark 1.00 out of 1.00Flag questionQuestion textAre ambiguous grammar context free? Question 11CorrectMark 1.00 out of 1.00Flag questionQuestion textThe recursive inference procedure determines that string w is in the language ofthe variable A, A being the starting variable. Question 12 Correct Mark 1.00 out of 1.00
Image of page 33
Flag question Question textA language accepted by Deterministic Push down automata is closed under which of the following? Feedback Your answer is correct. Question 13CorrectMark 1.00 out of 1.00Flag questionQuestion textA PDA machine configuration (p, w, y) can be correctly represented as ____________ . Select one:a. unprocessed input, stack content, current stateb. current state, stack content, unprocessed inputc. current state, unprocessed input, stack content Feedback Your answer is correct. Question 14 Correct Mark 1.00 out of 1.00
Image of page 34
Flag question Question textWhich among the following is not a part of the Context free grammar tuple? Feedback Your answer is correct. Question 15CorrectMark 1.00 out of 1.00Flag questionQuestion textProduction Rule: aAb->agb belongs to which of the following category? Feedback Your answer is correct. Question 16 Incorrect Mark 0.00 out of 1.00
Image of page 35
Flag question Question text A general purpose, programmable, information processor with input and output. Answer: Question 17CorrectMark 1.00 out of 1.00Flag questionQuestion textAny set that represents the value of the Regular Expression is called a Property set.Select one: Question 18CorrectMark 1.00 out of 1.00Flag questionQuestion textDifferent approaches to draw a derivation tree:* Starts from tree leaves. It proceeds upward to the root which Answer 1Bottom-up Approach central processing unit
Image of page 36
is the starting symbol S * Starts with the starting symbol S. It goes down to tree leaves using productions. Answer 2 Feedback Your answer is correct.
Image of page 37
Image of page 38

You've reached the end of your free preview.

Want to read all 63 pages?

  • Fall '16
  • Formal language, Formal languages, Formal grammar

Other Related Materials

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture