Exam 6: Syntax

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

The curly bracket { } notation used in extended Backus-Naur form stands for "at least one or more repetitions of."

(True/False)
4.7/5
(35)

____ languages require all tokens to occur in prespecified locations on the page.

(Multiple Choice)
4.8/5
(42)

____ automatically translate a BNF description into a parser.

(Multiple Choice)
4.8/5
(42)

During its ____ phase,a translator collects sequences of characters from the input program and forms them into tokens.

(Multiple Choice)
4.8/5
(35)

A requirement that a sentence must start with a capitalized letter is an example of a ____.

(Multiple Choice)
4.7/5
(40)

Ordinary syntax is sometimes called concrete syntax to distinguish it from abstract syntax.

(True/False)
4.8/5
(42)

Productions are in Backus-Naur form if they are given using only the metasymbols "<" and ">".

(True/False)
4.9/5
(31)

The simplest form of a parser is a(n)____.

(Multiple Choice)
4.8/5
(49)

The description of simple integer arithmetic expressions with addition and multiplication cannot be represented by a context-free grammar.

(True/False)
4.9/5
(42)

In a regular expression,curly braces are used to indicate a range of characters.

(True/False)
4.8/5
(42)

The process of associating the semantics of a construct to its syntactic structure is called syntax-directed semantics.

(True/False)
4.9/5
(42)

A parser that commits itself to a particular action based only on a lookahead is called a(n)____ parser.

(Multiple Choice)
4.8/5
(37)

Abstract syntax trees abstract the essential structure of the parse tree.

(True/False)
4.8/5
(31)

The lexical structure of a programming language is the structure of its tokens,or words.

(True/False)
4.8/5
(40)

The purpose of a(n)____ is to apply grammar rules to a source program and report syntax or lexical errors,without performing any additional analysis.

(Multiple Choice)
4.9/5
(27)

A bottom-up parser constructs derivations and parse trees from the leaves to the root.

(True/False)
4.8/5
(32)

Which of the following is not considered to be a token category?

(Multiple Choice)
4.9/5
(31)

White space is an example of a token delimiter.

(True/False)
4.9/5
(42)

Predictive parsing allows tokens that begin optional parts of the syntax to also appear after the optional part.

(True/False)
4.9/5
(37)

During the ____ phase,the translator processes the tokens,determining the program's syntactic structure.

(Multiple Choice)
4.8/5
(45)
Showing 21 - 40 of 50
close modal

Filters

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