Results 141 to 150 of about 1,093 (164)

A symbol-based extension of parsing expression grammars and context-sensitive packrat parsing

Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, 2017
Parsing expression grammars (PEGs) are a powerful and popular foundation for describing syntax. Despite PEGs' expressiveness, they cannot recognize many syntax patterns of popular programming languages. Typical examples include typedef-defined names in C/C++ and here documents appearing in many scripting languages.
openaire   +2 more sources

A Haskell Library for Adaptable Parsing Expression Grammars

Proceedings of the XXVII Brazilian Symposium on Programming Languages, 2023
Elton Maximo Cardoso, Rodrigo Geraldo Ribeiro, Leonardo Vieira dos Santos Reis, Marcos Emiliano   +3 more
openaire   +2 more sources

Parsing Expression Grammar and Packrat Parsing—A Review

2022
Nikhil S. Mangrulkar, Kavita R. Singh, Mukesh M. Raghuwanshi   +2 more
openaire   +1 more source

Parsing Expression Grammar and Packrat Parsing—A Review

Lecture Notes in Networks and Systems, 2023
Nikhil Mangrulkar, Kavita Singh, Mukesh Raghuwanshi   +2 more
exaly  

Type-based Termination Analysis for Parsing Expression Grammars

Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023
Elton M. Cardoso, Regina De Paula, Daniel Pereira, Leonardo Reis, Rodrigo Geraldo Ribeiro   +4 more
openaire   +2 more sources

Parsing expression grammar as a primitive recursive-descent parser with backtracking

Fundam. Informaticae, 2007
Summary: Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in terms of recognizing strings, rather than constructing them. It is, in fact, precise specification of a backtracking recursive-descent parser. Packrat parsing is a general
openaire   +2 more sources

A Rule-Based Parsing for Bangla Grammar Pattern Detection

Algorithms for Intelligent Systems, 2021
K M Azharul Hasan, Azharul Hasan K M
exaly  

Weighted parsing for grammar-based language models over multioperator monoids

Information and Computation, 2021
Heiko Vogler
exaly  

Simplified Parsing Expression Derivatives

Lecture Notes in Computer Science, 2020
Aaron Moss
exaly  

Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM, 2002
Lillian Lee
exaly