Next: About this document
Computer Science 3675
Summer 2000
Quiz 1
- Write a clearly legible T to the left of each of the
following that is true, and a clearly legible F to the left
of each that is false.
- All compilers translate to machine language.
- All programming language implementations are compilers.
- A simple value is a value that has no visible internal
structure.
- Integers are typically considered complex values.
- A data structure that changes over time is not
considered to be a value.
- A token can only have one associated lexeme.
- A variable name is typically a single lexeme in a program.
- Backus-Naur Form is a notation for giving precise definitions
of syntax.
- Pattern matching can be used to bind names by solving
simple equations.
- In C++, every block begins at the start of a function,
and ends at the end of the function.
- An implementation of a programming language is not
an adequate definition of the language. Why not? What
would be the consequences of using an implementation as a
definition?
- What is an important advantage of the linked representation
of sequences over the sequential representation?
- What is an important advantage of the sequential representation
of sequences over the linked representation?
- Show that the following BNF grammar is ambiguous.
The start symbol is .
- Show a parse tree for string
aacacab
according to
the following grammar, where the start symbol is .
Karl Abrahamson
Mon Jun 19 13:38:41 EDT 2000