6. Backus–Naur Form BNF is a text based metalanguage that is read right to left. This way, syntax can be represented by text, rather than diagrams
7. Extended Backus–Naur Form (EBNF) Invented to avoid the disadvantages of BNF. Easier to read, and less issues with things like repetition and optional elements
8. Is defined as BNF EBNF ::= Boolean::=T|F = Boolean=T|F
12. Optional Elements BNF EBNF No Optional Elements, so each option must be repeated Integer::- - {<digit>} |{<digit>} [ ] Integer=[-] {<digit>}
13. Repetition BNF EBNF No repetition Repetition through recursion Recursion is repetition achieved through a process calling itself Text page 170 Indicated by { } Word={Letter} Repeated zero or more times If it needs to be repeated one or more times, it is written as Word=Letter{Letter}
19. In Visual Basic Construct an EBNF diagram to describe a best practice, legal if statement. Should follow the following structure: If condition Then statements Else elsestatements