Date: Tue, 10 Dec 1996 16:45:05 GMT
Server: NCSA/1.4.2
Content-type: text/html
CSE 413 Midterm Topics, Winter 1996
CSE 413
Midterm Topics
Lisp
- Symbols, numbers, strings, lists
- List Manipulation
- Recursive Functions: be able to write a recursive definition of
things like LENGTH (to compute the length of a list),
COUNTATOMS (to count the number of atoms in an S
expression.
- Closures: what are they? How are they created, and how do they
behave?
- Scope and extent
- Mark-and-sweep garbage collection. How it works. Its advantages
and disadvantages.
Processing Programming Languages
- Languages over an alphabet as sets of finite-length strings.
- Regular expressions and how they correspond to regular
languages.
- How to construct a deterministic finite automaton that
corresponds to a particular regular expression.
- Finite automata for lexical analysis, especially for identifiers
and integers and numbers in exponential notation.
- Definition of a grammar.
- Derivation using a grammar.
- Sentential forms.
- What is a context-free grammar?
- Backus-Naur Form
- Parsing - what does it mean? Hand parsing of input strings
according to a given grammar.