Question 21

____ have been given an initial meaning for all programs in the language but are capable of being redefined.

		Predefined identifiers
		Keywords
		Global literals
		Constants

1 points

Question 22

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

True

False

1 points

Question 23

____ are phrase structures that are broken down into further phrase structures.

		Nonterminals
		Complex grammars
		Compressed structures
		Terminals

1 points

Question 24

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

True

False

1 points

Question 25

A recognizer is a program that accepts or rejects strings based on whether they have occurred before.

True

False