GlossariesA Level GlossariesA Level Computer Science GlossaryBackus-Naur Form (BNF)

Backus-Naur Form (BNF) - A Level Computer Science Definition

Reviewed by: James Woodhouse

Last updated

What is Backus-Naur Form?

In A Level Computer Science, Backus-Naur Form (BNF) is a notation used to formally define the syntax of programming languages. It provides a concise way to represent grammar rules, using symbols like <expression> to define structures.

Why is BNF important?

BNF is essential for compiler design and language specification, ensuring precise and unambiguous syntax definitions.

Examiner-written A Level Computer Science revision resources that improve your grades 2x

  • Written by expert teachers and examiners
  • Aligned to exam specifications
  • Everything you need to know, and nothing you don’t
A Level Computer Science revision resources

Share this article

James Woodhouse

Reviewer: James Woodhouse

Expertise: Computer Science & English Subject Lead

James graduated from the University of Sunderland with a degree in ICT and Computing education. He has over 14 years of experience both teaching and leading in Computer Science, specialising in teaching GCSE and A-level. James has held various leadership roles, including Head of Computer Science and coordinator positions for Key Stage 3 and Key Stage 4. James has a keen interest in networking security and technologies aimed at preventing security breaches.

The examiner written revision resources that improve your grades 2x.

Join now