Formal Languages and Translators: Difference between revisions
Jump to navigation
Jump to search
| Line 20: | Line 20: | ||
==Grammar== | ==Grammar== | ||
<span id='Derivation'></span>'''Derivation''' | |||
<span id='Production'></span>'''Production''' | |||
===Backus-Naur Form (BNF)=== | ===Backus-Naur Form (BNF)=== | ||
Revision as of 20:57, 13 July 2018
Internal
Overview
Compiler
Interpreter
Lexical Analysis
Regular Expressions
Finite Automata
Syntax Analysis (Parsing)
TODO Deplete This Parsing
Grammar
Derivation Production
Backus-Naur Form (BNF)
Extended Backus-Naur Form (EBNF)
Parse Tree
A parse tree is a graphical representation of a derivation. Each interior node of a parse tree represents the application of a production.