Results 11 to 20 of about 50,231 (194)
Error reporting in Parsing Expression Grammars
Science of Computer Programming, 2016 Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
André Murbach Maidl +3 more
core +6 more sources
Parsing Expression Grammars with Unordered Choices
Journal of Information Processing, 2017 Parsing expression grammars (PEGs) were formalized by Ford in 2004, and have several pragmatic operators (such as ordered choice and unlimited lookahead) for better expressing modern programming language syntax.
Nariyoshi Chida, Kimio Kuramitsu
semanticscholar +5 more sources
Implementation of Tamias to Check Production Rules for Parsing Expression Grammar
Journal of Robotics, Networking and Artificial Life, 2019 Backus–Naur Form (BNF) can express type-2 grammar (CFG: Context-Free Grammar) in the Chomsky hierarchy. Although BNF is traditionally used in the syntax definition of programming languages, it is possible to describe ambiguous grammar (e.g. dangling-else
Tetsuro Katayama +5 more
semanticscholar +4 more sources
Tamias: a Syntax File Checker for Parsing Expression Grammar
Proceedings of International Conference on Artificial Life and Robotics, 2019 Toshihiro Miyaji +5 more
semanticscholar +3 more sources
Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar [PDF]
Iberoamerican Congress on Pattern Recognition, 2015 In recognition of online handwritten mathematical expressions, symbol segmentation and classification and recognition of relations among symbols is managed through a parsing technique. Most parsing techniques follow a bottom-up approach and adapt grammars typically used to parse strings.
Frank Julca-Aguilar +3 more
semanticscholar +5 more sources
Cigale: A tool for interactive grammar construction and expression parsing
Science of Computer Programming, 1986 AbstractIn this paper we present CIGALE, a system for incremental grammar construction and expressions parsing. It is designed to cope with the problem of parsing in environments which require an incremental definition of languages and a great flexibility in syntax. Its main application, parsing in an environmental for Abstract Data Types specification,
Frédéric Voisin
semanticscholar +6 more sources
Exception Handling for Error Reporting in Parsing Expression Grammars [PDF]
Brazilian Symposium on Programming Languages, 2013 Parsing Expression Grammars (PEGs) are a new formalism to describe a top-down parser of a language. However, error handling techniques that are often applied to top-down parsers are not directly applicable to PEGs. This problem is usually solved in PEGs using a heuristic that helps to simulate the error reporting technique from top-down parsers, but ...
André Murbach Maidl +2 more
semanticscholar +4 more sources
CPEG: a typed tree construction from parsing expression grammars with regex-like captures [PDF]
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2018 CPEG is an extended parsing expression grammar with regex-like capture annotation. Two annotations (capture and left-folding) allow a flexible construction of syntax trees from arbitrary parsing patterns.
Daisuke Yamaguchi, Kimio Kuramitsu
semanticscholar +5 more sources
From regexes to parsing expression grammars [PDF]
Science of Computer Programming, 2012 Most scripting languages nowadays use regex pattern-matching libraries. These regex libraries borrow the syntax of regular expressions, but have an informal semantics that is different from the semantics of regular expressions, removing the commutativity of alternation and adding ad-hoc extensions that cannot be expressed by formalisms for efficient ...
Sérgio Queiroz de Medeiros +2 more
openalex +3 more sources
The computational power of parsing expression grammars [PDF]
Journal of Computer and System Sciences, 2020 We study the computational power of parsing expression grammars (PEGs). We begin by constructing PEGs with unexpected behaviour, and surprising new examples of languages with PEGs, including the language of palindromes whose length is a power of two, and a binary-counting language.
Bruno Loff, Nelma Moreira, Rogério Reis
openalex +5 more sources