CS Unplugged: Field guide: Formal Languages
An online resource for teaching Computer Science to students, this chapter focusses on Formal Languages. This chapter covers the strict rules specified in formal languages and describes examples of its use. Find out about regular expressions including an example, Finite state automata.
Additional details
| Year band(s) | 3-4, 5-6, 7-8, 9-10 |
|---|---|
| Format | Web page |
| Core and overarching concepts | Implementation (programming) |
| Technologies & Programming Languages | other programming languages |
| Keywords | Formal Languages, Regular expressions, Finite state automata, Grammars, Parsing, Chomsky Hierarchy |
| Organisation | University of Canterbury, New Zealand |
| Copyright | University of Canterbury, New Zealand. Creative Commons BY-NC-SA 4.0. |
Related resources
-
A matter of style
In this lesson sequence, students using the Zen Garden website reflect on criteria for effective design.
-
Google CS First: Storytelling
CS First: Storytelling guides students to use block-based coding in Scratch projects through a series of themed activities.
-
Scope and sequence overview
This resource provides a possible set of sequenced topics that could be used in teaching the Australian Curriculum Digital Technologies curriculum to address the content descriptions of the curriculum.
-
F-2: Digital systems: Hardware and software
At the F-2 level, students develop understandings of digital systems (hardware and software) when they use some key functions to undertake authentic curriculum tasks.
-
F-2: Digital systems: Changes in Technology
Changes to technology over time has affected many aspects of life.