BNF - Syntax Diagrams

Overview

https://www.youtube.com/watch?v=x1gGInKNCRw&list=PLCiOXwirraUAnbNTfWFxkoq5MoIair49B&index=6

BNF

Backus Naur Form is a way of describing the syntax of a of a language.

The symbols used are:

::= 	is defined as

|    	or

< >   	meta variables or syntactic variables (non-terminal symbols)

For example a numerical digit could be defined as:

<digit> ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9

This declares that <digit> can only be the numbers 0-9, specifically 0 OR 1 OR 2 OR 3 etc. 'A', 'B' , or 'C' would clearly be invalid digits.

The variables created can be used to define other variables for example:

<lesson> ::= A | B | C 
<lesson code> ::= <lesson><digit>

This notation can also be recursive:

<integer> ::= <digit> | <digit><integer>

This states that an integer can be a digit or a digit followed by another integer. If the definition was just '<digit> <digit>' this would only allow integers of exactly 2 digits.

Quiz

To see if you remember what you have learned about BNF, take this quick test either by yourself, or with friends: https://play.kahoot.it/#/?quizId=cad3ec51-29de-45d6-968d-6a95958553f2

Syntax Diagrams

These are a diagram approach similar to BNF, they also describe the syntax allowed. You are looking for path from left to right, some paths can loop back to allow for multiple digits.

so using this diagram, we can see that a digit can be 0-9, and alpha can only be A,B,J, or Z. A stock code must therefore start with one of the alpha characters and then followed by a colon. It can then have any combination of alpha characters or digit characters. Therefore a stock code starting 'AA:' will be invalid, as will a stock code starting '1:'.

A another example, this time it is recursive (factor uses exp as part of the diagram):

Follow this example from the bottom up, starting at digit and then progress up the diagrams.