Search results for "left-recursion"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
88	Alessandro Warth, James R. Douglass, Todd D. Millstein	Packrat parsers can support left recursion.	PEPM	2008	DBLP DOI BibTeX RDF	left recursion, packrat parsing
76	Richard A. Frost, Rahmatullah Hafiz	A new top-down parsing algorithm to accommodate ambiguity and left recursion in polynomial time.	ACM SIGPLAN Notices	2006	DBLP DOI BibTeX RDF	left-recursion, top-down parsing, backtracking, memoization, parser combinators
62	Adrian Johnstone, Elizabeth Scott	Generalised Regular Parsers.	CC	2003	DBLP DOI BibTeX RDF
51	Alan J. Demers	Generalized Left Corner Parsing.	POPL	1977	DBLP DOI BibTeX RDF
48	Anton Nijholt	On the Covering of Left Recursive Grammars.	POPL	1977	DBLP DOI BibTeX RDF	left-recursion, parsing, grammar, cover, context-free
31	Richard A. Frost, Rahmatullah Hafiz, Paul Callaghan	Parser Combinators for Ambiguous Left-Recursive Grammars.	PADL	2008	DBLP DOI BibTeX RDF	left recursion, natural-language parsing, functional programming, ambiguity, Parser combinators
24	Ken C. Liu, Arthur C. Fleck	String Pattern Matching in Polynomial Time.	POPL	1979	DBLP DOI BibTeX RDF
24	Roman R. Redziejowski	Left Recursion by Recursive Ascent.	CS&P	2021	DBLP BibTeX RDF
24	Roman R. Redziejowski	Left Recursion by Recursive Ascent.	CS&P (Revised Selected Papers)	2021	DBLP DOI BibTeX RDF
24	Luke A. D. Hutchison	Pika parsing: reformulating packrat parsing as a dynamic programming algorithm solves the left recursion and error recovery problems.	CoRR	2020	DBLP BibTeX RDF
24	James Smith	Eliminating Left Recursion without the Epsilon.	CoRR	2019	DBLP BibTeX RDF
24	Hirotaka Niitsuma	Context-Free Grammars Including Left Recursion using Recursive miniKanren.	Computación y Sistemas	2018	DBLP DOI BibTeX RDF
24	Roman R. Redziejowski	More about Left Recursion in PEG.	CS&P	2018	DBLP BibTeX RDF
24	Sérgio Medeiros 0001, Fabio Mascarenhas, Roberto Ierusalimschy	Left recursion in Parsing Expression Grammars.	Sci. Comput. Program.	2014	DBLP DOI BibTeX RDF
24	Omran Younessi, Mohamad H. Bahrololoomi, Abedin Yazdani	The extension of deterministic cancellation parser to directly handle indirect and hidden left recursion.	CCECE	2013	DBLP DOI BibTeX RDF
24	Sérgio Medeiros 0001, Fabio Mascarenhas, Roberto Ierusalimschy	Left Recursion in Parsing Expression Grammars	CoRR	2012	DBLP BibTeX RDF
24	Sérgio Medeiros 0001, Fabio Mascarenhas, Roberto Ierusalimschy	Left Recursion in Parsing Expression Grammars.	SBLP	2012	DBLP DOI BibTeX RDF
24	Hayo Thielecke	Functional semantics of parsing actions, and left recursion elimination as continuation passing.	PPDP	2012	DBLP DOI BibTeX RDF
24	Rahmatullah Hafiz	Executable Specifications of Fully General Attribute Grammars with Ambiguity and Left-Recursion.	Canadian AI	2009	DBLP DOI BibTeX RDF
24	Wolfgang Lohmann, Günter Riedewald, Markus Stoy	Semantics-preserving Migration of Semantic Rules During Left Recursion Removal in Attribute Grammars.	LDTA@ETAPS	2004	DBLP DOI BibTeX RDF
24	Robert C. Moore	Removing Left Recursion from Context-Free Grammars.	ANLP	2000	DBLP BibTeX RDF
24	Reino Kurki-Suonio	On top-to-bottom recognition and left recursion.	Commun. ACM	1966	DBLP DOI BibTeX RDF
19	H. Peter Gumm	Continuations of logic programs.	Algebraic Logic and Universal Algebra in Computer Science	1988	DBLP DOI BibTeX RDF
17	Jaroslav Král	A Top-Down No Backtrack Parsing of General Context-Free Languages.	MFCS	1977	DBLP DOI BibTeX RDF
12	Elizabeth Scott, Adrian Johnstone	Reducing non-determinism in right nulled GLR parsers.	Acta Informatica	2004	DBLP DOI BibTeX RDF
12	Adrian Johnstone, Elizabeth Scott, Giorgios Economopoulos	Generalised Parsing: Some Costs.	CC	2004	DBLP DOI BibTeX RDF
12	David B. Lomet	A Formalization of Transition Diagram Systems.	J. ACM	1973	DBLP DOI BibTeX RDF