Certified CYK parsing of context-free languages
type: Item
instance of: scholarly article
title: Certified CYK parsing of context-free languages
zbMATH Open document ID: 1371.68137
author: Denis Firsov
author: Tarmo Uustalu
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2014-10-23T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6360848
zbMATH Keywords: certified programs
zbMATH Keywords: parsing
zbMATH Keywords: Cocke-Younger-Kasami algorithm
zbMATH Keywords: dependently typed programming
zbMATH Keywords: Agda
describes a project that uses: TRX
describes a project that uses: Agda
MaRDI profile type: Publication
full work available at URL: j.jlamp.2014.09.002
OpenAlex ID: W2055851776
cites work: Certified Parsing of Regular Languages
cites work: Dependently Typed Programming in Agda
cites work: Recognition and parsing of context-free languages in time n3
cites work: General context-free recognition in less than cubic time
cites work: Terminating general recursion
cites work: Verified, Executable Parsing
cites work: TRX: A Formally Verified Parser Interpreter
cites work: Validating LR(1) Parsers
cites work: Total parser combinators
cites work: Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
DOI: 10.1016/J.JLAMP.2014.09.002
Recommended article: Certified Parsing of Regular Languages
Recommended article: On parsing coupled-context-free languages
Recommended article: Short Notes: Semantically Driven Parsing of Context-free Languages
Recommended article: Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda
Recommended article: Systolic parsing of context-free languages
Recommended article: Flexible Combinatory Categorial Grammar Parsing Using the CYK Algorithm and Answer Set Programming
Recommended article: Parsing Beyond Context-Free Grammars
Recommended article: Q3837989
Recommended article: INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
Recommended article: Efficient parallel and incremental parsing of practical context-free languages
description: scientific article; zbMATH DE number 6360848