Home > Computers > Computer Science > Theoretical > Formal Language Theory
Formal language theory is defined to be the study of sets of words over finite alphabets. In formal language theory a word in a language can be accepted by a device (automaton) or generated by a grammar. The four languages of the Chomsky hierarchy (regular, context free, context sensitive and recursively enumerable languages) are typically studied.
http://web.cecs.pdx.edu/~jhein/lectures/Section.14.2.pdf#search="context sensitive languages"
A brief discussion of context sensitive languages, recursively enumerable languages and languages with no grammars. Examples show these are not equivalent.
http://www.inf.unibz.it/~artale/Compiler/slide2.pdf
A lecture on grammars, generating languages from grammars, the Chomsky classification and derivation trees.
http://everything2.com/index.pl?node_id=113762
An introductory approach to the topic using many examples.
http://www.helsinki.fi/esslli/courses/readers/K10.pdf
A draft manuscript with chapters on set theory, regular languages, context free languages and the Chomsky hierarchy.
http://www.cs.princeton.edu/courses/archive/fall2000/cs126/lectures/T3-4up.pdf#search="context sensitive languages compilers"
A set of slides on grammars and language generation, with examples including a grammar for an abbreviated C language.
http://www.cse.unsw.edu.au/~billw/cs9414/notes/notes.html
Description of several types of formal grammars for natural language processing, parse trees, and a number of parsing methods.
http://www.ling.upenn.edu/courses/Fall_2006/ling106/Ling106.htm
Lecture notes providing definitions, examples, theorems and problems. Course taught at University of Pennsylvania, Department of Linguistics.
Home > Computers > Computer Science > Theoretical > Formal Language Theory
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us