Imagen de Portada

Towards Automatic Error Recovery in Parsing Expression

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	de Medeiros, Sérgio Queiroz, Mascarenhas, Fabio
Formato:	Preprint
Publicado:	2025
Materias:	Programming Languages Formal Languages and Automata Theory F.4.3; D.3.1; D.3.4
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

LR Parsing of Permutation Phrases
por: Kostičová, Jana
Publicado: (2024)

Non-reducible Modal Transition Systems
por: Basile, Davide
Publicado: (2023)

Learning real-time one-counter automata using polynomially many queries
por: Mathew, Prince, et al.
Publicado: (2024)

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
por: Glück, Robert, et al.
Publicado: (2024)

INTERLEAVE: A Faster Symbolic Algorithm for Maximal End Component Decomposition
por: Bansal, Suguman, et al.
Publicado: (2025)

Parsing Hypergraphs using Context-Free Positional Grammars
por: Costagliola, Gennaro, et al.
Publicado: (2026)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
por: Geatti, Luca, et al.
Publicado: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
por: Mathew, Prince, et al.
Publicado: (2025)

A Word Sampler for Well-Typed Functions
por: Considine, Breandan
Publicado: (2025)

Quantitative Assurance and Synthesis of Controllers from Activity Diagrams
por: Ye, Kangfeng, et al.
Publicado: (2024)

CBCL: Safe Self-Extending Agent Communication
por: O'Connor, Hugo
Publicado: (2026)

Introducing Divergence for Infinite Probabilistic Models
por: Finkel, Alain, et al.
Publicado: (2023)

Algebraic Language Theory with Effects
por: Lenke, Fabian, et al.
Publicado: (2024)

Commuting upper triangular binary morphisms
por: Honkala, Juha
Publicado: (2023)

Active Learning Techniques for Pomset Recognizers
por: Pommellet, Adrien, et al.
Publicado: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
por: Löding, Christof, et al.
Publicado: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
por: Fisman, Dana, et al.
Publicado: (2023)

Store Languages of Turing Machines and Counter Machines
por: Friesen, Noah, et al.
Publicado: (2025)

Active Learning of Upward-Closed Sets of Words
por: Aristote, Quentin
Publicado: (2025)

Deciding DFA-Primality is NP-Hard
por: Spenner, Daniel Alexander
Publicado: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
por: Udupa, Sumukha, et al.
Publicado: (2024)

Verifying Unboundedness via Amalgamation
por: Anand, Ashwani, et al.
Publicado: (2024)

Omega-Regular Robustness
por: Fisman, Dana, et al.
Publicado: (2025)

Runtime Consultants
por: Fisman, Dana, et al.
Publicado: (2025)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

On History-Deterministic One-Counter Nets
por: Prakash, Keya, et al.
Publicado: (2022)

Monads, Comonads, and Transducers
por: Stefański, Rafał
Publicado: (2024)

Automata with Timers
por: Bruyère, Véronique, et al.
Publicado: (2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
por: Havel, Martin, et al.
Publicado: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
por: Doveri, Kyveli, et al.
Publicado: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
por: Hopkins, Mark, et al.
Publicado: (2023)

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds
por: Varatalu, Ian Erik, et al.
Publicado: (2024)

On Repetitive Finite Automata with Translucent Words
por: Mráz, František, et al.
Publicado: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
por: Löding, Christof, et al.
Publicado: (2022)

Recognizing Numbers
por: Gaba, Pranshu, et al.
Publicado: (2025)

Lexicographic transductions of finite words
por: Filiot, Emmanuel, et al.
Publicado: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
por: Rote, Günter
Publicado: (2024)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
por: Bojańczyk, Mikołaj, et al.
Publicado: (2021)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
por: Rote, Günter
Publicado: (2024)