Linked from

The 12 pages that link to Parsing, each with the reason it gives.

• CompilerBroader topic: It checks whether the token sequence fits the programming language's grammar.

• Formal languageRelated: Parsing determines whether an input has grammatical structure and what that structure is.

• Partial functionRelated: A parser may be modeled as a partial function when some inputs are not valid expressions.

• Context-free grammarRelated: Parsing applies grammar rules to identify the structure of source code or other input.

• Abstract syntax treeRelated: A parser constructs an AST from source text or tokens.

• Formal grammarRelated: Parsers use grammars to recognize strings and recover their derivations.

• InterpreterRelated: Interpreters commonly parse source text before evaluating its structure.

• DerivationRelated: A grammar derivation can show how a string is generated from its start symbol.

• Order of operationsRelated: Parsing converts precedence conventions into a structured interpretation of an expression.

• Chomsky hierarchyRelated: Grammar classes constrain which parsing algorithms and computational resources are available.

• Computational linguisticsRelated: Parsing converts word sequences into explicit syntactic structures.

• Type conversionCompared with: Parsing may create a typed value from text, but it is not simply a type change.