Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
Recursive grammar
Known as:
Non-recursive grammar
In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Chomsky hierarchy
Computer science
Context-free language
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Parsing expression grammars made practical
N. Laurent
,
K. Mens
Software Language Engineering
2015
Corpus ID: 1539319
Parsing Expression Grammars (PEGs) define languages by specifying a recursive-descent parser that recognises them. The PEG…
Expand
2014
2014
Sentence Processing in a Vectorial Model of Working Memory
William Schuler
CMCL@ACL
2014
Corpus ID: 3911365
This paper presents a vectorial incremental parsing model defined using independently posited operations over activationbased…
Expand
2011
2011
Explicitly Recursive Grammar Combinators - A Better Model for Shallow Parser DSLs
Dominique Devriese
,
Frank Piessens
International Symposium on Practical Aspects of…
2011
Corpus ID: 16404918
We propose a novel context-free grammar representation for parsing libraries in a pure programming language. Our representation…
Expand
2011
2011
Universal Higher Order Grammar
Victor E. Gluzberg
arXiv.org
2011
Corpus ID: 2783791
We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory…
Expand
2011
2011
What in the World Makes Recursion so Easy to Learn? A Statistical Account of the Staged Input Effect on Learning a Center-Embedded Structure in Artificial Grammar Learning (AGL)
F. Poletiek
Biolinguistics
2011
Corpus ID: 54571090
In an artificial grammar learning study, Lai & Poletiek (2011) found that human participants could learn a center-embedded…
Expand
2010
2010
Explicitly recursive grammar combinators - The implementation of some grammar algorithms - Technical report
Dominique Devriese
,
Frank Piessens
2010
Corpus ID: 17611434
In a companion paper, we have presented an alternative representation of grammars in Haskell, explicitizing the grammar’s…
Expand
2010
2010
Visualized LL parsing of non-left-recursive grammar
yingli Zhang
International Conference on Optics, Photonics and…
2010
Corpus ID: 12319431
The Visualized LL parsing is presented, the algorithm is based on non-left recursive grammar, and in the environment of VC++, it…
Expand
2007
2007
Ambiguity Detection Methods for Context-Free Grammars
Bas Basten
2007
Corpus ID: 17749776
textabstractThe Meta-Environment enables the creation of grammars using the SDF formalism. From these grammars an SGLR parser can…
Expand
2004
2004
Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars
Wolfgang Lohmann
,
G. Riedewald
,
Markus Stoy
LDTA@ETAPS
2004
Corpus ID: 39748838
1998
1998
Dependence analysis for recursive data
Yanhong A. Liu
Proceedings of the International Conference on…
1998
Corpus ID: 564656
The paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE