Results 1 to 10 of about 51,328 (185)
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
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
A Haskell library for Adaptable Parsing Expression Grammars
Journal of Computer LanguagesElton M. Cardoso +2 more
openalex +2 more sources
Some of the next articles are maybe not open access.
Elaborations on L2 interactional competence: the development of L2 grammar-for-interaction
Classroom Discourse, 2018Simona Pekarek Doehler
exaly
THE ROLES OF PHONOLOGICAL SHORT-TERM MEMORY AND WORKING MEMORY IN L2 GRAMMAR AND VOCABULARY LEARNING
Studies in Second Language Acquisition, 2012exaly
Two Approaches to the Facilitation of Grammar in Children With Language Impairment
Journal of Speech, Language, and Hearing Research, 2018exaly
Secure Input Validation in Rust with Parsing-Expression Grammars
, 2019 Madeleine Dease. Dawson
openalex
“gnparser”: a powerful parser for scientific names based on Parsing Expression Grammar [PDF]
BMC Bioinformatics, 2017 Background Scientific names in biology act as universal links. They allow us to cross-reference information about organisms globally. However variations in spelling of scientific names greatly diminish their ability to interconnect data.
Dmitry Y. Mozzherin +2 more
doaj +8 more sources
Linear Parsing Expression Grammars [PDF]
Language and Automata Theory and Applications, 2017 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 +10 more sources