Formal Languages and Translators

From NovaOrdis Knowledge Base
Jump to navigation Jump to search

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. A parse tree does not contain the information that reflects the order in which productions are applied to replace nonterminals.

(Abstract) Syntax Tree

Parser

Top-Down Parser

Bottom-Up Parser

Semantic Analysis