abstract ;;Quote: a bounded context grammar is unambiguous with syntactic analysis in linear time; appropriate for most programming languages

62 ;;Quote: a language is a set of strings; a production is an ordered pair, a character and a nonempty string

64 ;;Quote: for many practical grammars, one character of context is sufficient; construct a table of character pairs and tables of first and last characters of each derivative for each character Quote:

66 ;;Quote: A->x|xAx is a pathological language; not bounded context; syntactic analysis is ad hoc, breaks down, or goes factorial

66 ;;Quote: a formal definition of semantics requires a process of interpretation and a representation of information