Computer Science 164 - Spring 1998 - Rowe - Midterm 1

Computer Science 164 - Spring 1998 - Rowe - Midterm 1 -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science 164 - Spring 98 Midterm Examination Professor L. Rowe Problem #1 (30 points) Define the following terms: parser terminal symbol abstract class method abstract syntax tree pushdown automaton grammar rule automatic parser generator handle instance arbitrary rewrite system syntax directed translation rvalue leftmost derivation reduce/reduce error Problem #2 (10 points) Answer the following: T F A pushdown automaton can recognize a language defined by a regular grammar. T F A bottom-up parser performs reductions in the same order as a rightmost derivation. T F A variable declared in Java to be a type Class can reference the object Object . T F Class variables cannot be defined in a Java abstract class. T F A nondeterministic fsa can recognize languages that a deterministic fsa cannot recognize. Problem #3
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

Computer Science 164 - Spring 1998 - Rowe - Midterm 1 -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online