Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

Left recursion

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, 1 + 2 + 3 {\displaystyle 1+2+3} can be recognized as a sum because it can be…

Applications, Art & Science

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Left recursion. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Accommodating left recursion in top-down parsing

ParsedLL(k)-parserWeakly equivalentLALR parsersRight recursion
11 related topics

Definition

If and only ifSentential formRecursive descent parserEmpty string
4 related topics

Removing left recursion

Top-down parsersBottom-up parsersTopological ordering
3 related topics

Pitfalls

Parse treesWitnessTree rewriting
3 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Definition

Uses

Removing left recursion

Pitfalls

Accommodating left recursion in top-down parsing

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Left recursion

Nodes34
Edges33
Triples35
Avg. degree1.94
Density0.058824
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Left recursion

Top relations

related to Accommodating left recursion in top-down parsing · 10
Left recursion → Callaghan, Frost, Hafiz, Haskell, However, In, LALR, LL, That, The
related to Removing all left recursion · 7
Left recursion → Add, For, If, Let, Remove, Repeat, The
related to Uses · 5
Left recursion → Expression, In, Left, Term, These
related to Indirect left recursion · 4
Left recursion → Indirect, It, Note, The
related to Direct left recursion · 3
Left recursion → Direct, For, It
related to Removing direct left recursion · 3
Left recursion → For, Several, The
related to Removing left recursion · 2
Left recursion → Left, Therefore
is a · 1
Left recursion → 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

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

recursion displaystyle left nonterminal rule alpha beta grammar direct rightarrow remove sequence left-recursive parsing indirect form nonterminals rules algorithm add

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
Left recursionis aspecial 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 language0.90text
Left recursionrelated to Accommodating left recursion in top-down parsingLL0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingIn0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingLALR0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingHowever0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingFrost0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingHafiz0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingThat0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingCallaghan0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingThe0.60section
Left recursionrelated to Accommodating left recursion in top-down parsingHaskell0.60section
Left recursionrelated to Direct left recursionDirect0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.