Cover Image

LR Parsing of Permutation Phrases

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kostičová, Jana
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Programming Languages F.4.2; D.3.1; D.3.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Towards Automatic Error Recovery in Parsing Expression
by: de Medeiros, Sérgio Queiroz, et al.
Published: (2025)

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

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

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

Accelerating Verified-Compiler Development with a Verified Rewriting Engine
by: Gross, Jason, et al.
Published: (2022)

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

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
by: Schaefer, Steven, et al.
Published: (2025)

Various Types of Comet Languages and their Application in External Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2024)

High-Performance Generation of Constrained Inputs
by: Crump, Addison, et al.
Published: (2025)

Identity Testing for Stochastic Languages
by: Agarwal, Smayan, et al.
Published: (2025)

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

Non-reducible Modal Transition Systems
by: Basile, Davide
Published: (2023)

Inferring Input Grammars from Code with Symbolic Parsing
by: Bettscheider, Leon, et al.
Published: (2025)

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

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
by: Pighizzini, Giovanni
Published: (2026)

Learn, Check, Test -- Security Testing Using Automata Learning and Model Checking
by: Marksteiner, Stefan, et al.
Published: (2025)

Model-bounded monitoring of hybrid systems
by: Waga, Masaki, et al.
Published: (2021)

Bridging Chaos Game Representations and $k$-mer Frequencies of DNA Sequences
by: He, Haoze, et al.
Published: (2025)

On some Classes of Reversible 2-head Automata
by: Nagy, Benedek, et al.
Published: (2025)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
by: Ibarra, Oscar H., et al.
Published: (2024)

Exploring Large Language Models for Access Control Policy Synthesis and Summarization
by: Vatsa, Adarsh, et al.
Published: (2025)

Well-Quasi-Orderings on Word Languages
by: Lhote, Nathan, et al.
Published: (2025)

A Uniform Framework for Problems on Context-Free Grammars
by: Esparza, Javier, et al.
Published: (2024)

Probability and Angelic Nondeterminism with Multiset Semantics
by: Ong, Shawn, et al.
Published: (2024)

Parameterized Verification of Timed Networks with Clock Invariants
by: André, Étienne, et al.
Published: (2024)

Verified VCG and Verified Compiler for Dafny
by: Nezamabadi, Daniel, et al.
Published: (2025)

TensorRight: Automated Verification of Tensor Graph Rewrites
by: Arora, Jai, et al.
Published: (2025)

Decision Problems on Copying and Shuffling
by: Halava, Vesa, et al.
Published: (2023)

Quantitative Verification of Omega-regular Properties in Probabilistic Programming
by: Wang, Peixin, et al.
Published: (2025)

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

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

Have a thing? Reasoning around recursion with dynamic typing in grounded arithmetic
by: Bobrow, Elliot, et al.
Published: (2025)

Specifying and Verifying the Convergence Stairs of the Collatz Program
by: Ebnenasir, Ali
Published: (2024)

A New Graph Grammar Formalism for Robust Syntactic Pattern Recognition
by: Fletcher, Peter
Published: (2025)

A Word Sampler for Well-Typed Functions
by: Considine, Breandan
Published: (2025)

Contract-based Verification of Digital Twins
by: Naeem, Muhammad, et al.
Published: (2025)

Anti-Context-Free languages
by: Cardó, Carles
Published: (2024)

Difficulty Generating Factors for Context-free Language Construction Assignments
by: Schmalstieg, Florian, et al.
Published: (2025)

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

Quasi-stratified Order Semantics of Concurrency
by: Koutny, Maciej, et al.
Published: (2024)