Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Societies legitimate themselves through their foundational narratives, which provide meaning, orientation, and perspectives… 
2009
2009
In this paper, a new reversible watermarking method is presented that reduces the size of a stereoscopic image sequence while… 
Review
2008
Review
2008
. Short vector instructions (SIMD) can significantly increase performance, yet are difficult to use effectively. Recently, several e… 
2007
2007
A T the meeting of the London Mathematical Society, June, 1898, I showed a model of ten lines in space, each intersecting three… 
2004
2004
*Topographical divisions of the abdomen  Theoretically, the examination of alimentary system starts from mouth, oral cavity… 
1994
1994
A one-pass translation algorithm may be constructed by an extension of LR(k) parser for some R-translation grammars. An LR parser… 
1994
1994
This paper extends the “parsing as deduction” approach to tree‐adjoining grammars by showing how a TAG recognition problem can be… 
1994
1994
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing… 
1992
1992
It is widely believed that top down parsing is incompatible with left recursive grammars. We show that this is not true. We… 
1957
1957
Let A be a Banach algebra with a Hilbert space norm (norm defined by a scalar product). We shall call A a right complemented…