Topic:Compilers and language theory
 |
This resource is currently unmaintained. Please feel welcome to adopt it and then change this tag. |
One of the areas in Computer Science where the mathematical underpinnings are most obvious is in the design and construction of program language compilers and interpreters. It is exceptionally difficult to work in this area without taking some time to study and understand automata and formal languages. This topic page is for organizing the development of Compilers and language theory content on Wikiversity.
If you are knowledgeable in any area Compilers and language theory, feel free to improve upon what you see, we would greatly appreciate your contributions.
Learning projects and resources [edit]
Learning materials and learning projects can be used by multiple departments. Please cooperate with other departments that use the same learning resource.
Remember, Wikiversity has adopted the "learning by doing" model for education. Lessons should center on learning activities for Wikiversity participants. We learn by doing.
Also, select a descriptive name for each learning project. Learning projects can be listed in alphanumeric order by code. Code numbers are optional, however.
