About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 169. Chapters: Context-free grammar, Chomsky hierarchy, Regular expression, Regular language, Formal language, Pumping lemma, Backus-Naur Form, Regular grammar, Context-sensitive grammar, Chomsky normal form, Recursively enumerable language, Kleene star, Context-sensitive language, String, Markup language, Extended Backus-Naur Form, Abstract syntax tree, L-system, Greibach normal form, Context-free language, Star height problem, Augmented Backus-Naur Form, Kleene algebra, Diff, Concatenation, Metacharacter, Junction Grammar, Controlled grammar, Interpretation, Antimatroid, Parsing expression grammar, Rewriting, Categorial grammar, Formal grammar, Adaptive grammar, Nested word, Well-formed formula, Abstract rewriting system, Recursive languages and sets, Syntactic predicate, Semi-Thue system, Finite state transducer, Definite clause grammar, Pumping lemma for regular languages, Longest increasing subsequence, Parser combinator, Left recursion, Stochastic context-free grammar, SCIgen, Trace monoid, Indexed grammar, Semiautomaton, Compiler Description Language, Formal system, Semantics encoding, Proof, Van Wijngaarden grammar, History monoid, Terminal and nonterminal symbols, Abstract family of acceptors, String operations, Free monoid, Descriptional Complexity of Formal Systems, Metasyntax, Action algebra, Quasi-quotation, Operator-precedence grammar, Introduction to Automata Theory, Languages, and Computation, Pumping lemma for context-free languages, Non-logical symbol, Regulated rewriting, Minimalist grammar, Top-down parsing language, Language identification in the limit, Head grammar, Wirth syntax notation, Ambiguous grammar, Mildly context-sensitive language, Attribute grammar, Global index grammar, Formal semantics, Affix grammar, Empty string, Post canonical system, Cone, Tell-tale, Intended interpretation, Wirth-Weber prec...
