Relaxed Parsing of Regular Approximations of String-Embedded Languages

DOI10.1007/978-3-319-41579-6_22zbMath1461.68107OpenAlexW2487504410MaRDI QIDQ3179182

Dmitry Avdyukhin, Semyon Grigorev, Ekaterina Verbitskaia

Publication date: 21 December 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-41579-6_22

zbMATH Keywords

parsingstring analysisparser generatorRNGLRstring-embedded languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Reducing non-determinism in right nulled GLR parsers
• The inclusion problem for some subclasses of context-free languages
• Automata-based symbolic string analysis for vulnerability detection
• Unnamed Item