Select Connection: INPUT[inlineListSuggester(optionQuery(#permanent_note), optionQuery(#literature_note), optionQuery(#fleeting_note)):connections]
Hierarchy of formal grammars. A formal grammar describes how to form strings from a language alphabet that are valid according to the language syntax.
Each class in the hierarchy can completely generate the language of all inferior classes (set inclusive).
Hierarchy:
- Regular Expressions ⇒ recognized by Finite State Automata (FA)
- Context-Free Grammars and Languages ⇒ recognized by Pushdown Automata
- Context Sensitive
- Recursively Enumerable ⇒ recognized by Turing Machines