Exam 6: Syntax

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

A left-recursive rule for an operation causes it to left-associate.

(True/False)
4.9/5
(32)

Reserved words,or keywords,are not considered to be a typical token category.

(True/False)
4.8/5
(31)

Recursive-descent parsers turn the nonterminals into a group of mutually recursive procedures whose actions are based on the right-hand side of the BNFs.

(True/False)
4.7/5
(34)

The use of a single token to direct a parse is called single-symbol ____.

(Multiple Choice)
5.0/5
(44)

____ are descriptions of patterns of characters.

(Multiple Choice)
4.8/5
(33)

A context-free grammar has a special nonterminal called the ____ symbol which stands for the entire top-level phrase being defined.

(Multiple Choice)
4.8/5
(43)

Words or tokens are called terminals,since they cannot be broken down further.

(True/False)
4.8/5
(37)

Grammar rules are also called ____.

(Multiple Choice)
4.8/5
(33)

The principle of ____ takes the longest possible string of nonblank characters into a single token.

(Multiple Choice)
4.8/5
(38)

The processing of white space is generally handled by a ____.

(Multiple Choice)
4.8/5
(36)
Showing 41 - 50 of 50
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)