This resource covers the following topics: Language Definition Problem, Specifying Formal Languages, Specifying Lexical Structure Using Regular Expressions, Concept of Regular Expression Generating a String, Nondeterminism in Generation, Concept of Language Generated by Regular Expressions, Alternate Abstraction Finite-State Automata, Automaton Accepting String, Generative Versus Recognition, From Regular Expressions to Automata, Basic Constructs, Sequence, Choice, Kleene Star, NFA vs. DFA, Conversions, NFA to DFA Construction, Lexical Structure in Languages, Lexical Categories Example, Programming Language Syntax, Production Game, Sample Derivation, Parse Tree, Ambiguity in Grammar, Eliminating Ambiguity, Parse Trees for Hacked Grammar, Precedence Violations, Hacking Around Precedence, Parse Tree Changes, Abstract Syntax Trees, Handling If Then Else, Hacked Grammar, Grammar Vocabulary, Defining a Language, Regular Languages, Grammar and Automata Correspondence, Context-Free Grammars, Push-Down Automata, CFG Versus PDA, and Context-Sensitive Grammars and Turing Machines.