Results 161 to 170 of about 50,231 (194)
Some of the next articles are maybe not open access.
A parsing machine for parsing expression grammars with labeled failures
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016Parsing Expression Grammars (PEGs) are a formalism for specifying the syntax of programming languages which can be viewed as a description of a recursive descent parser for the language it describes. An issue that users of PEG-based parsers face is poor reporting of syntax errors on the part of PEG-based parsers.
Sérgio Medeiros, Fabio Mascarenhas
openaire +2 more sources
Research Report: Parsing PEGs with Length Fields in Software and Hardware
2021 IEEE Security and Privacy Workshops (SPW), 2021Since parsers are the line of defense between binaries and untrusted data, they are some of the most common sources of vulnerabilities in software. Language-Theoretic Security provides an approach to implement hardened parsers.
Zephyr Lucas +3 more
semanticscholar +1 more source
Software Language Engineering, 2021
Incremental parsing is an integral part of code analysis performed by text editors and integrated development environments. This paper presents new methods to significantly improve the efficiency of incremental parsing for Parsing Expression Grammars ...
Zachary Yedidia, Stephen Chong
semanticscholar +1 more source
Incremental parsing is an integral part of code analysis performed by text editors and integrated development environments. This paper presents new methods to significantly improve the efficiency of incremental parsing for Parsing Expression Grammars ...
Zachary Yedidia, Stephen Chong
semanticscholar +1 more source
Towards Typed Semantics for Parsing Expression Grammars
Proceedings of the XXIII Brazilian Symposium on Programming Languages, 2019 We describe the formalization of a type system for parsing expression grammars (PEG) which is equivalent to Ford's original fixpoint-based definition of well-formed PEGs. We use our type system definition to implement a functional big-step semantics for typed PEGs using the Agda programming language.
Rodrigo Ribeiro +3 more
openalex +2 more sources
2023 IEEE 6th Eurasian Conference on Educational Innovation (ECEI), 2023
Based on the form language structure, the chain grammar formal structure framework is used to realize the form of sentences and reconstruct the management system of the chain grammar sentence dictionary.
Lin Chen
semanticscholar +1 more source
Based on the form language structure, the chain grammar formal structure framework is used to realize the form of sentences and reconstruct the management system of the chain grammar sentence dictionary.
Lin Chen
semanticscholar +1 more source
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.
Kimio Kuramitsu
openalex +3 more sources
Typed parsing and unparsing for untyped regular expression engines
PEPM@POPL, 2019Regular expressions are used for a wide variety of purposes from web-page input validation to log file crawling. Very often, they are used not only to match strings, but also to extract data from them.
Gabriel Radanne
semanticscholar +1 more source
Lexical Parsing Expression Recognition Schemata
2015 24th Australasian Software Engineering Conference, 2015M. Lumpe
semanticscholar +1 more source
Parsing/Theorem-Proving for Logical Grammar CatLog3
Journal of Logic, Language and Information, 2019G. Morrill
semanticscholar +1 more source
Parsing Expression Grammar and Packrat Parsing—A Review
2022Nikhil S. Mangrulkar +2 more
openaire +1 more source