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) | 9-10 |
|---|---|
| Format | Web page |
| Core and overarching concepts | Implementation (programming), Digital systems, Data representation, Algorithms |
| Australian Curriculum Digital Technologies code(s) |
AC9TDI10P03
Model and query entities and their relationships using structured data
AC9TDI10P05
Design algorithms involving logical operators and represent them as flowcharts and pseudocode
AC9TDI10P06
Validate algorithms and programs by comparing their output against a range of test cases
AC9TDI10P09
Implement, modify and debug modular programs, applying selected algorithms and data structures, including in an object-oriented programming language |
| 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
-
Computational thinking
This comprehensive online guide, provides a background to computational thinking which refers to the skills and approaches used in computing, programming, and digital solutions to analyse problems and determine how to solve them.
-
Object-oriented programming (OOP)
This comprehensive online guide, explores ways the OOP method of programming (or paradigm) is different to the procedural paradigm, which many programmers start out with on their learning journey. This topic introduces objects and how they can be defined and worked with in a computer system.
-
Program design
This comprehensive online guide, explores ways specific algorithms are designed for large applications, considering data and user interface. Learn how algorithms can be expressed as a flowchart and pseudocode, and validated and verified.
-
Tinker challenge: if/else: simple conditional response
This video is part of the lesson idea Coding a sentimental chatbot in Python that is located on the Digital Technologies Hub.
-
Tinker challenge: respond to the user's sentiment
This video is part of the lesson idea Coding a sentimental chatbot in Python that is located on the Digital Technologies Hub.
-
A spreadsheet's secret weapon
In this lesson sequence, students learn to use pivot tables which have been described as the most powerful tool within spreadsheets.
-
Emulating nature's perfect pursuit
A case study briefly describing an AI project where scientists have adapted dragonflies’ neuronal processes into a unique algorithm that emulates the insect’s phenomenal visual tracking capability.
-
Topics: General purpose programming/coding
This is a curated topic for Coding and general purpose and programming.