In the version of EBNF that became the ECMA and ISO standard, the following changes were made

If we have  G = (V, S, σ,  ) and we observe that x  y we say that y is ___ derived from x

If r and s are regular expressions over a set A, write the expression that means "either r or s".

If I make a tree diagram of the syntax of, say, a sentence, and the leaves are "Teagan", "bites", and "door", than this is a(n) ___ parse tree

The theorem "A language is regular iff ∃ a Moore machine that accepts all the strings of the language." is named after __ (last name only)

How many binary trees are there of order 3?

A derivation from the start symbol towards the actual sentence is not complete until the right-hand-side contains only ___.

When we write G = (V, S, σ,  ) the symbol "" means

Given TM = (S, I, O, δ, σ₀) S represents

Which of the following binary strings are numerals for an even number