1. Engineering
  2. Computer Science
  3. is it possible for anyone to solve these multiple choice...

Question: is it possible for anyone to solve these multiple choice...

Question details

Is it possible for anyone to solve these multiple choice questions?

  1. When angle braces appear somewhere in a BNF production -- for example -- it's interpreted to mean whatever appears inside the braces is
    1. a non-terminal symbol
    2. a terminal symbol
    3. the start symbol
    4. optional
  2. In BNF, an ellipse (or three periods in a row) -- as in A | B | ... | Z -- can be used to denote
    1. part of an obvious sequence of alternatives has been omitted
    2. recursion in the productions
    3. problematic inaccuracies in the productions
    4. repetitions of terminal or non-terminal symbols
  3. In a context-free grammar, each production rule has the form non-terminal derives sequence of symbols.
    1. True
    2. False
  4. A grammar is unambiguous if every sentence has exactly one derivation.
    1. True
    2. False
  5. According to the following production rules:

::=

::= |

::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

which of the following strings are valid according to the   grammar ?

  1. 9               
  2. 53
  3. 842
  4. 0011
  5. Question 6. The sequence of BNF rule substitutions that demonstrates a sentence is grammatically correct is called
    1. integration
    2. Translation
    3. Derivation
    4. Piping

  1. A grammar is ambiguous if there are two different derivations for the same sentence.
    1. True
    2. False
  2. Choose the correct term for each letter and fill in the blank

In a BNF grammar rule, the characters a -- also called the    b    symbol -- mean substitute whatever is on the c side of the symbol for what you see on the     d    side of the symbol.

  1. production , left, ::=, or right
  2. production , left, ::=, or right
  3. production , left, ::=, or right
  4. production , left, ::=, or right

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution