Search references for RECURSIVE GRAMMAR. Phrases containing RECURSIVE GRAMMAR
See searches and references containing RECURSIVE GRAMMAR!RECURSIVE GRAMMAR
Computer science and linguistics concept relating to non-terminal production
In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal
Recursive_grammar
Top-down parser utilizing recursion
of the grammar. Thus the structure of the resulting program closely mirrors that of the grammar it recognizes. A predictive parser is a recursive descent
Recursive_descent_parser
Type of a context-free grammar
LL grammars; for parsing, see LL parser or recursive descent parser. Given a natural number k ≥ 0 {\displaystyle k\geq 0} , a context-free grammar G =
LL_grammar
Structure of a formal language
language translation tools. A recursive grammar is a grammar that contains production rules that are recursive. For example, a grammar for a context-free language
Formal_grammar
Type of grammar for describing formal languages
expression grammar can be converted directly into a recursive descent parser. Due to the unlimited lookahead capability that the grammar formalism provides
Parsing_expression_grammar
Process of repeating items in a self-similar way
defining the other cases recursively in terms of the simple one. A recursive grammar is a formal grammar that contains recursive production rules. Recursion
Recursion
Use of functions that call themselves
solutions to smaller instances of the same problem. Recursion solves such recursive problems by using functions that call themselves from within their own
Recursion_(computer_science)
World Wide Web Consortium standard
the expressive power of a context-free grammar. A grammar processor that does not support recursive grammars has the expressive power of a finite-state
Speech Recognition Grammar Specification
Speech_Recognition_Grammar_Specification
Theory of computer sciences
sum, and +3, a suitable suffix. In terms of context-free grammar, a nonterminal is left-recursive if the leftmost symbol in one of its productions is itself
Left_recursion
concept of recursive "nesting" ("every A is eventually followed by a matching B"). A classic example of a problem which a regular grammar cannot handle
Comparison of parser generators
Comparison_of_parser_generators
Parsing technique
Simple implementations of top-down parsing do not terminate for left-recursive grammars, and top-down parsing with backtracking may have exponential time
Top-down_parsing
Computer program
random text from recursive grammars. A free version is also hosted online. The essays are produced from a formal grammar defined by a recursive transition network
Postmodernism_Generator
Type of formal grammar
generated grammar. Byte pair encoding The Grammatical-Ziv-Lempel algorithm (GLZA),, which creates a low entropy context-free grammar using a recursive, relatively
Straight-line_grammar
Function computable with bounded loops
In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all
Primitive_recursive_function
Analysing a string of symbols, according to the rules of a formal grammar
context-free grammars and parsing expression grammars Pratt parser Recursive descent parser: a top-down parser suitable for LL(k) grammars Shunting-yard
Parsing
Type of parser in computer science
commonly used to parse left recursive grammars. They use a smaller amount of stack space than regular recursive descent parsers, given that the runtime
Tail_recursive_parser
Hierarchy of classes of formal grammars
string of terminals and/or non-terminals Note that the set of grammars corresponding to recursive languages is not a member of this hierarchy; these would
Chomsky_hierarchy
Software programming optimization technique
ambiguous CFG in polynomial time (Θ(n4) for left-recursive grammars and Θ(n3) for non left-recursive grammars). Their top-down parsing algorithm also requires
Memoization
Higher-order function that combines several parsers
input triggers them. In such cases, the recursive descent parser may default (perhaps unknown to the grammar designer) to one of the possible ambiguous
Parser_combinator
Categories of symbols in formal grammars
symbols are {S,A}. Alphabet (formal languages) Chomsky Hierarchy Recursive grammar It contains no symbols at all. This example supports strings with
Terminal and nonterminal symbols
Terminal_and_nonterminal_symbols
Type of formal grammar
an unrestricted grammar, other than each of their left-hand sides being non-empty. This grammar class can generate arbitrary recursively enumerable languages
Unrestricted_grammar
Rule system for formal languages
as agreement and reference are not part of the context-free grammar, but the basic recursive structure of sentences, the way in which clauses nest inside
Context-free_grammar
Lossless, but memory-consuming, data compression algorithm
for recursive pairing) is a grammar-based compression algorithm that, given an input text, builds a straight-line program, i.e. a context-free grammar generating
Re-Pair
Formal grammar
were classified by Shutt as imperative. Introduced in 1993, Recursive Adaptive Grammars (RAGs) were an attempt to introduce a Turing powerful formalism
Adaptive_grammar
Set with algorithmic membership test
computability theory, a set of natural numbers is computable (or decidable, or recursive) if there is an algorithm that computes the membership of every natural
Computable_set
American linguist (1916–2000)
of their ability to utilize Design Feature 5: Total Feedback, or recursive grammar. This includes being able to correct oneself and insert explanatory
Charles_F._Hockett
Unix shell
either a top-down or bottom-up parser capable of recognizing a fully recursive grammar. It is not known why an ad hoc design was chosen instead for the C
C_shell
Formal language
valid strings of the language. These are generated by unrestricted grammars. Recursively enumerable languages are known as type-0 languages in the Chomsky
Recursively enumerable language
Recursively_enumerable_language
Mathematical logic concept
a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable
Computably_enumerable_set
American linguist known for recursive categorical syntax
better understand syntax and simplify traditional theories of grammar, stressing the recursive nature of language and the hierarchical arrangement of linguistic
Michael_Brame
Study of the formation of composite units
following: Recursive categorical syntax, or algebraic syntax Functional generative description Meaning–text theory Operator grammar Word grammar Lucien Tesnière
Syntax
Formal language in mathematics and computer science
science, a recursive (or decidable) language is a recursive subset of the Kleene closure of an alphabet. Equivalently, a formal language is recursive if there
Recursive_language
Theory of the biological component of the language faculty
Universal grammar (UG), in modern linguistics, is the theory of the innate biological component of the language faculty, usually credited to Noam Chomsky
Universal_grammar
Algorithm for parsing context-free languages
linear time and space for non-right recursive LR(k) grammars, O(n2) quadratic time and space for unambiguous grammars, O(n3) cubic time and O(n2) quadratic
Earley_parser
Sequence of words formed by specific rules
language is often defined by means of a formal grammar such as a regular grammar or context-free grammar. In computer science, formal languages are used
Formal_language
Two functions defined from each other
example is given by recursive descent parsers, which can be naturally implemented by having one function for each production rule of a grammar, which then mutually
Mutual_recursion
Type of parser in computer science
are called recursive. This grammar uses recursive rules to handle repeated math operators. Grammars for complete languages use recursive rules to handle
LR_parser
String rewriting system
of Formal Languages: Word, language, grammar, Springer, 1997, ISBN 3-540-60420-0. Post, Emil (1947). "Recursive Unsolvability of a Problem of Thue". The
Semi-Thue_system
A recursive transition network ("RTN") is a graph theoretical schematic used to represent the rules of a context-free grammar. RTNs have application to
Recursive_transition_network
Mathematical model for deduction or proof systems
then generalizing it. A formal system is said to be recursive (i.e. effective) or recursively enumerable if the set of axioms and the set of inference
Formal_system
Mathematical function that can be computed by a program
being Turing machines, register machines, lambda calculus and general recursive functions. Although these four are of a very different nature, they provide
Computable_function
Bottom-up parser that interprets an operator-precedence grammar
primary With many levels of precedence, implementing this grammar with a predictive recursive-descent parser can become inefficient. Parsing a number,
Operator-precedence_parser
Thesis on the nature of computability
with Jacques Herbrand, formalized the definition of the class of general recursive functions: the smallest class of functions (with arbitrarily many arguments)
Church–Turing_thesis
Type of formal grammar
basis for natural language: for any recursively enumerable set R, there exists a context-sensitive language/grammar G which can be used as a sort of proxy
Context-sensitive_grammar
In computer science, recursive ascent parsing is a technique for implementing an LR parser which uses mutually-recursive functions rather than tables
Recursive_ascent_parser
Formalization of the natural numbers
Primitive recursive arithmetic (PRA) is a quantifier-free formalization of the natural numbers. It was first proposed by Norwegian mathematician Skolem
Primitive recursive arithmetic
Primitive_recursive_arithmetic
Earliest model of generative grammar
GTs were abandoned in favor of recursive phrase structure rules, but they are still present in tree-adjoining grammar as the Substitution and Adjunction
Transformational_grammar
Branch of mathematical logic
combinatorial independence results, and (3) classifications of provably total recursive functions and provably well-founded ordinals. Ordinal analysis was originated
Proof_theory
Type of parser
similarities with the recursive descent parser in its construction. However, it differs because it takes parsing expression grammars (PEGs) as input rather
Packrat_parser
Study of computable functions and Turing degrees
mathematical constructions can be effectively performed is sometimes called recursive mathematics. Computability theory originated in the 1930s, with the work
Computability_theory
Proof method in mathematical logic
proposition to hold for all x.) A structurally recursive function uses the same idea to define a recursive function: "base cases" handle each minimal structure
Structural_induction
Controlled grammars are a class of grammars that extend, usually, the context-free grammars with additional controls on the derivations of a sentence in
Controlled_grammar
at least informal contact. The idea of LL(1) grammars was introduced by Lewis and Stearns (1968). Recursive descent was popularised by Niklaus Wirth with
History of compiler construction
History_of_compiler_construction
Formal grammar
language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can be seen as a special
Regular_tree_grammar
Mathematical-logic system
is M; this means a recursive function definition cannot be written with let. The letrec construction would allow writing recursive function definitions
Lambda_calculus
Class of modern grammatical theories
Dependency grammar (DG) is a class of modern grammatical theories that are all based on the dependency relation (as opposed to the constituency relation
Dependency_grammar
Grammar model in linguistics
of recursive generation of strings from a grammar. Parsing: Finding a valid derivation using an automaton. Parse Tree: The alignment of the grammar to
Probabilistic context-free grammar
Probabilistic_context-free_grammar
Concept in linguistics
Model-theoretic grammars, also known as constraint-based grammars, contrast with generative grammars in the way they define sets of sentences: they state
Model-theoretic_grammar
Text-string-oriented programming language
unlike SNOBOL4 patterns, are not recursive, which gives a distinct computational advantage to SNOBOL4 patterns. (Recursive expressions did appear in Perl
SNOBOL
System of arithmetic in proof theory
reverse mathematics (Simpson 2009). Elementary recursive arithmetic (ERA) is a subsystem of primitive recursive arithmetic (PRA) in which recursion is restricted
Elementary function arithmetic
Elementary_function_arithmetic
Abstract grammatical formalism
linguistics, combinatory categorial grammar (CCG) is an efficiently parsable, yet linguistically expressive, grammar formalism. It has a transparent interface
Combinatory categorial grammar
Combinatory_categorial_grammar
Type of neural network which utilizes recursion
A recursive neural network is a kind of deep neural network created by applying the same set of weights recursively over a structured input, to produce
Recursive_neural_network
Branch of mathematical logic
reverse mathematics. The initials "RCA" stand for "recursive comprehension axiom", where "recursive" means "computable", as in computable function. This
Reverse_mathematics
Top-down parser that parses input from left to right
to LR parsers, but LL grammars can also be parsed by recursive descent parsers. According to Waite and Goos (1984), LL(k) grammars were introduced by Stearns
LL_parser
Notation techniques for grammars in computer science
Context-free grammars, a concept from structural linguistics, were adopted for this purpose; their rules can express how sentences are recursively built out
Van_Wijngaarden_grammar
Standard system of axiomatic set theory
symbol = The set membership symbol ∈ Brackets (, ) With this alphabet, the recursive rules for forming well-formed formulae (wff) are as follows: Let x and
Zermelo–Fraenkel_set_theory
Logical connective AND
Boolean-valued function – Function that outputs either true or false Conjunction (grammar) – Part of speech that connects two words, sentences, phrases, or clauses
Logical_conjunction
Diagram that shows all possible logical relations between a collection of sets
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Venn_diagram
Yes/no problem in computer science
effectively solvable if the set of inputs for which the answer is YES is a recursive set. A decision problem is partially decidable, semidecidable, solvable
Decision_problem
Problem in computer science
0′ (the "jump" of class 0) representing the class of recursively enumerable, but not recursive, sets of numbers, or similarly Σ10 of the arithmetical
Halting_problem
Technique for defining number-theoretic functions by recursion
1-ary primitive recursive function g the value of g(n+1) is computed only from g(n) and n. The factorial function n! is recursively defined by the rules
Course-of-values_recursion
Syntactically correct logical formula
sequence of symbols from a given alphabet, constructed following the defined grammar of a formal language. The abbreviation wff is pronounced "woof", or sometimes
Well-formed_formula
Higher-order function which returns some fixed point of the input function
in functional programming languages, and provide a means to allow for recursive definitions. Applied to a non-constant function of one variable that treats
Fixed-point_combinator
Infinite cardinal number
Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps,
Aleph_number
Group of words in systemic functional grammar
In systemic functional grammar (SFG), a nominal group is a group of words that represents or describes an entity, for example The nice old English police
Nominal group (functional grammar)
Nominal_group_(functional_grammar)
Proposition in mathematical logic
Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal Theories
Continuum_hypothesis
Axioms for the natural numbers
→ (X, 0X, SX) is such that u(0)=0X,u(S)=SX(u). This is precisely the recursive definition of 0X and SX. When the Peano axioms were first proposed, Bertrand
Peano_axioms
Mathematical logic concept
any contradictions either. This other system, today called "primitive recursive arithmetic with the additional principle of quantifier-free transfinite
Gentzen's_consistency_proof
Form of mathematical proof
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Mathematical_induction
Fundamental theorem in mathematical logic
interpret its own construction, so that this construction is non-recursive (as recursive definitions would be unambiguous). Also, if T is at least slightly
Gödel's_completeness_theorem
sentences. W. A. Woods in "Transition Network Grammars for Natural Language Analysis" argues that by adding a recursive mechanism to a finite state model, parsing
Augmented_transition_network
Grammatical features of Classical Nahuatl
LOC:locative; CISL:cislocative ('towards'); TRSL:translocative ('away from'); The grammar of Classical Nahuatl is agglutinative, head-marking, and makes extensive
Classical_Nahuatl_grammar
Recursive algorithm for data compression
is a recursive algorithm developed by Craig Nevill-Manning and Ian H. Witten in 1997 that infers a hierarchical structure (context-free grammar) from
Sequitur_algorithm
Non-contradiction of a theory
strong, recursively enumerable, consistent theory of arithmetic can never be proven in that system itself. The same result is true for recursively enumerable
Consistency
Yes-or-no question that cannot ever be solved by a computer
called decidable or effectively solvable if the formalized set of A is a recursive set. Otherwise, A is called undecidable. A problem is called partially
Undecidable_problem
3-volume treatise on mathematics, 1910–1913
rules: The theory specifies the rules of syntax (rules of grammar) usually as a recursive definition that starts with "0" and specifies how to build
Principia_Mathematica
In logic, a statement which is always true
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Tautology_(logic)
Branch of mathematics that studies sets
0-type, with universal properties of sets arising from the inductive and recursive properties of higher inductive types. Principles such as the axiom of
Set_theory
Statement that is taken to be true
context of Gödel's first incompleteness theorem, which states that no recursive, consistent set of non-logical axioms Σ of the Theory of Arithmetic is
Axiom
Academic subfield of computer science
gives the value of the recursive function applied to the inputs. Markov algorithm a string rewriting system that uses grammar-like rules to operate on
Theory_of_computation
Index of articles associated with the same name
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Stratification_(mathematics)
Mathematical set of all subsets of a set
identity, assuming |S| = n: |2S|=2n=∑k=0n(nk) If S is a finite set, then a recursive definition of P(S) proceeds as follows: If S = {}, then P(S) = { {} }
Power_set
Establishment of a theorem using inference from the axioms
meaning. Formal proofs are expressed in some formal languages. A formal grammar (also called formation rules) is a precise description of the well-formed
Formal_proof
Axiom of set theory
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Axiom_of_choice
Ability to solve a problem by an effective procedure
gives the value of the recursive function applied to the inputs. String rewriting systems Includes Markov algorithms, that use grammar-like rules to operate
Computability
Mathematical set containing no elements
Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps,
Empty_set
Function that preserves distinctness
problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory Related Abstract logic Algebraic
Injective_function
Type of formal grammar
Conjunctive grammars are a class of formal grammars studied in formal language theory. They extend the basic type of grammars, the context-free grammars, with
Conjunctive_grammar
Set theory concept
back into the definition of the rank of a set gives a self-contained recursive definition: The rank of a set is the smallest ordinal number strictly
Von_Neumann_universe
Concept in generalized context free grammar
Head grammar (HG) is a grammar formalism introduced in Carl Pollard (1984) as an extension of the context-free grammar class of grammars. Head grammar is
Head_grammar
travel, tourism, insurance
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
RECURSIVE GRAMMAR
travel, tourism, insurance