Polish parsers, step by step

DOI10.1145/944705.944727zbMath1315.68075OpenAlexW2128580729MaRDI QIDQ5261279

S. Doaitse Swierstra, R. John M. Hughes

Publication date: 2 July 2015

Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/944705.944727

zbMATH Keywords

breadth-first searchPolish representationambiguous grammarsGLR parsingparser combinatorsonline results

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (2)

A principled approach to programming with nested types in Haskell ⋮ Efficient parallel and incremental parsing of practical context-free languages

This page was built for publication: Polish parsers, step by step