About: Left recursion

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Left recursion Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right). For instance, can be recognized as a sum because it can be broken into , also a sum, and , a suitable suffix.

Attributes	Values
rdfs:label	Left recursion (en)
rdfs:comment	In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right). For instance, can be recognized as a sum because it can be broken into , also a sum, and , a suitable suffix. (en)
sameAs	Left recursion Left recursion
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Clarify dbt:Technical
Subject	Control flow Parsing Recursion Formal languages
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Left_recursion?oldid=1059754802&ns=0
Wikipage page ID	1418498 (xsd:integer)
page length (characters) of wiki page	11731 (xsd:nonNegativeInteger)
Wikipage revision ID	1059754802 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal grammar Formal language Tail call Ambiguous grammar Bottom-up parsing CYK algorithm Control flow Parsing Recursion Formal languages Witness (mathematics) Terminal and nonterminal symbols Computer science Context-free grammar Parse tree Parser combinator Parsing Rewriting Empty string Equivalence (formal languages) Haskell (programming language) LALR parser LL parser Top-down parsing Topological sorting Polynomial Recursion (computer science) Recursive descent parser Recursive grammar
has abstract	In the formal language theory of computer science, left recursion is a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right). For instance, can be recognized as a sum because it can be broken into , also a sum, and , 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 (in the case of direct left recursion) or can be made itself by some sequence of substitutions (in the case of indirect left recursion). (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Left_recursion
is Link from a Wikipage to another Wikipage of	Formal grammar Greibach normal form ANTLR Compiler-compiler Earley parser Index of philosophy articles (I–Q) LL grammar LL parser Memoization
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Left_recursion

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 983 MB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software