**A Level Computer Science: Regular languages expressions, BNF and RPN**

This module contains:

##### Compatible with the following examination boards

### Download A Level Module 58: Regular languages expressions, BNF and RPN

**This download is exclusively for Teach Computer Science subscribers!**

To download this file, click the button below to signup (it only takes a minute) and you'll be brought right back to this page to start the download!

Already a member? Log in to download.

**Regular languages expressions, BNF and RPN**

Regular expressions are used to define and search sets. They are also used to find patterns in data. As a result, they are widely used for searching and managing string operations.

Context-free languages are used to describe the syntax of a programming language. We will learn how Backus-Naur Form (BNF) and Syntax diagrams are used to describe the syntax of a programming language.

Finally, Reverse Polish Notation (RPN) is introduced. RPN is a method to express mathematical expressions.

This A Level Computer Science module introduces regular languages expressions, BNF and RPN, to your students, explaining:

- Regular expressions and their representation in FSM
- Regular languages
- Context-free languages: Backus-Naur form (BNF) and Syntax diagrams
- Reverse Polish Notation

**More Regular languages and functional programming Modules**

Regular languages expressions, BNF and RPN is one lesson in our Regular languages and functional programming module. The other theory lessons can be found below: