Efficient parallel and incremental parsing of practical context-free languages

DOI10.1017/S0956796815000131zbMath1419.68059OpenAlexW2149979723MaRDI QIDQ5371946

Koen Claessen, Jean-Philippe Bernardy

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796815000131

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10)

Uses Software

• criterion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parsing by matrix multiplication generalized to Boolean grammars
• On the parallel recognition of unambiguous context-free languages
• Optimal parallel parsing of bracket languages
• Lazy dynamic-programming can be eager
• General context-free recognition in less than cubic time
• Gaussian elimination is not optimal
• Functional Pearls
• On certain formal properties of grammars
• Finger trees: a simple general-purpose data structure
• FUNCTIONAL PEARL Parallel Parsing Processes
• Efficient divide-and-conquer parsing of practical context-free languages
• Polish parsers, step by step
• Recognition and parsing of context-free languages in time n3

This page was built for publication: Efficient parallel and incremental parsing of practical context-free languages