Recursive ascent parsing: From Earley to Marcus
type: Item
instance of: scholarly article
title: Recursive ascent parsing: From Earley to Marcus
zbMATH Open document ID: 0754.68072
DOI: 10.1016/0304-3975(92)90127-2
author: René Leermakers
published in: Theoretical Computer Science
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 95809
zbMATH Keywords: functional implementation technique
zbMATH Keywords: parsers for context-free grammars
zbMATH Keywords: recursive functions
zbMATH Keywords: function memoization
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)90127-2
OpenAlex ID: W2164260211
cites work: SL parses the LR languages
cites work: An efficient context-free parsing algorithm
cites work: On a recursive ascent parser
cites work: A recursive ascent Earley parser
cites work: A functional LR parser
cites work: Q3888556
cites work: Q4040864
description: scientific article; zbMATH DE number 95809