Back to marketplace

Context-free languages

No description yet. This curated deck is ready for daily study.

Total cards: 10•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (10)

#1
Front (Question)

What is Backus-Naur form?

Back (Answer)

A context-free grammar used by developers of programming languages to specify the syntax rules of a language

#2
Front (Question)

What are production rules?

Back (Answer)

A range of symbols and expressions combined

#3
Front (Question)

What are <> used for in BNF?

Back (Answer)

Denote a non-terminal symbol A non-terminal symbol appearing on the right side of a production rule means there’ll be another rule after to define the contents of the chevrons

#4
Front (Question)

What is | | used for in BNF?

Back (Answer)

Showing terminal symbols, these values cannot be broken down and defined further. They are the building blocks

#5
Front (Question)

What symbol must be included in BNF statements at some point?

Back (Answer)

Terminal symbols

#6
Front (Question)

Can recursion be used in BNF?

Back (Answer)

Yes

#7
Front (Question)

What does a parse tree do?

Back (Answer)

Breaks something down into it’s component parts

#8
Front (Question)

What are parse trees often used to do?

Back (Answer)

Check whether a string satisfies a production rule

#9
Front (Question)

What is the diagrammatic approach to BNF called?

Back (Answer)

A syntax diagram

#10
Front (Question)

State the rules of reading a syntax diagram

Back (Answer)

Read left to right Follow the arrows You can’t go back unless a loop arrow is included