context-free grammar
Nonterminal rewriting system
A context-free grammar is a formal system in computer science and linguistics for defining the structure of languages, particularly programming languages and mathematical notations.
It consists of rules specifying how symbols can be replaced or expanded, where each rule applies regardless of surrounding context—hence "context-free." These grammars are essential for parsing, allowing compilers to analyze code structure.
The parser uses a context-free grammar to validate the syntax.
At the endpoint
- derivationSource or origin tracing
- formal languageElevated, rule-governed expression
- Chomsky hierarchyClassification of formal grammars
- symbolRepresentational mark or sign
- syntaxRules for arranging words
- constituencyElectoral district's voters
- noun phraseMulti-word noun construction
- verb phraseAction-centered grammatical unit
sentence structure · grammaticality · recursion · embedding · subordination
Syntax-interpreting program
- abstract syntax treeHierarchical code representation
- ambiguityOpenness to multiple interpretations
- lookaheadAdvance examination technique
- syntax errorInvalid code structure
Items piled vertically
- decidabilityAlgorithmic resolution capability
- nondeterministicHaving multiple possible outcomes
- acceptanceConsent to receive
- configurationArrangement of parts
Formal notation for computer instructions
- code generationAutomated software creation
- natural language processingComputational analysis of speech
- speech recognitionMachines understanding human talk
- bioinformaticsComputational analysis of genetic data
terminal
At the endpoint
- derivationSource or origin tracing
- formal languageElevated, rule-governed expression
- Chomsky hierarchyClassification of formal grammars
Chomsky
- syntaxRules for arranging words
- constituencyElectoral district's voters
- noun phraseMulti-word noun construction
verb phrase · sentence structure · grammaticality · recursion · embedding · subordination
parser
Syntax-interpreting program
- abstract syntax treeHierarchical code representation
- ambiguityOpenness to multiple interpretations
- lookaheadAdvance examination technique
stack
Items piled vertically
- decidabilityAlgorithmic resolution capability
- nondeterministicHaving multiple possible outcomes
- acceptanceConsent to receive
programming language
Formal notation for computer instructions
- code generationAutomated software creation
- natural language processingComputational analysis of speech
- speech recognitionMachines understanding human talk
- parsingparser, parsing, BNF, terminals, tokenization
- syntax theoriesminimalist program, CCG, merge, government, agree
- grammardeclension, pronouns, adjectives, conjugation, nouns
- programming languagesC, C++, BASIC, C#, Java
- syntaxsentence, verb, noun, adjective, adverb
- Algorithm Analysisruntime, running time, growth rate, complexity, linear
grammar, context, recontextualization, contexts, contextualize, contextualized, contextually, decontextualize, recontextualize