Results 21 to 30 of about 50,231 (194)
Computational Model for Parsing Expression Grammars [PDF]
We present a computational model for Parsing Expression Grammars (PEGs). The predecessor of PEGs top-down parsing languages (TDPLs) were discovered by A. Birman and J. Ullman in the 1960-s, B. Ford showed in 2004 that both formalisms recognize the same class named Parsing Expression Languages (PELs). A. Birman and J.
Alexander A. Rubtsov, Nikita Chudinov
openalex +5 more sources
Syntax error recovery in parsing expression grammars [PDF]
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018 Parsing Expression Grammars (PEGs) are a formalism used to describe top-down parsers with backtracking. As PEGs do not provide a good error recovery mechanism, PEG-based parsers usually do not recover from syntax errors in the input, or recover from syntax errors using ad-hoc, implementation-specific features.
Sérgio Queiroz de Medeiros +1 more
openalex +4 more sources
XML schema validation using parsing expression grammars
, 2015 Schema validation is an integral part of reliable information exchange on the Web. However, implementing an efficient schema validation tool is not easy. We highlight the use of parsing expression grammars (PEGs), a recognition-based foundation for describing syntax, and apply it to the XML/DTD validation.
Kimio Kuramitsu, Shin’ya Yamaguchi
+5 more sources
CONVERSÃO DE REGEXES PARA PARSING EXPRESSION GRAMMARS [PDF]
, 2010 MARCELO OIKAWA
openalex +2 more sources
Automatic Syntax Error Reporting and Recovery in Parsing Expression Grammars [PDF]
Science of Computer Programming, 2019 Error recovery is an essential feature for a parser that should be plugged in Integrated Development Environments (IDEs), which must build Abstract Syntax Trees (ASTs) even for syntactically invalid programs in order to offer features such as automated refactoring and code completion.
Sérgio Queiroz de Medeiros +2 more
+9 more sources
The formalization and implementation of Adaptable Parsing Expression Grammars
Science of Computer Programming, 2014 The term "extensible language" is especially used when a language allows the extension of its own concrete syntax and the definition of the semantics of new constructs. Most popular tools designed for automatic generation of syntactic analysers do not offer any adequate resources for the specification of extensible languages.
Leonardo Vieira dos Santos Reis +3 more
openalex +3 more sources
A text pattern‐matching tool based on Parsing Expression Grammars [PDF]
Software: Practice and Experience, 2008 AbstractCurrent text pattern‐matching tools are based on regular expressions. However, pure regular expressions have proven too weak a formalism for the task: many interesting patterns either are difficult to describe or cannot be described by regular expressions.
Roberto Ierusalimschy
openalex +2 more sources
Recognising and Generating Terms using Derivatives of Parsing Expression Grammars
, 2018 Grammar-based sentence generation has been thoroughly explored for Context-Free Grammars (CFGs), but remains unsolved for recognition-based approaches such as Parsing Expression Grammars (PEGs). Lacking tool support, language designers using PEGs have difficulty predicting the behaviour of their parsers. In this paper, we extend the idea of derivatives,
Tony Garnock-Jones +2 more
openalex +4 more sources
الاضطرابات الفكرية في تعدد الأوجه الإعرابية
مجلة المهرة للعلوم الإنسانية, 2023 وقف الباحث على جملة من الشواهد النحوية غير المستأنسة من الفترة التي شهدت نشأة النحو وتقعيده إلى القرن الرابع الهجري، وذلك في مسألة تعدد الأوجه الإعرابية في المسألة الواحدة؛ إذ يرى فيها اضطرابًا بيِّنًا، موضِّحا أسباب ذلك الاضطراب وبواعثه التي تتجلى في ...
يحيى بن محمد بن عبدالله البلوشي
doaj +1 more source
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala
, 2019 In today's computerized world, parsing is ubiquitous. Developers parse logs, queries to databases and websites, programming and natural languages. When Java ecosystem maturity, concise syntax, and runtime speed matters, developers choose parboiled2 that generates grammars for parsing expression grammars (PEG).
Alexander A. Myltsev
openalex +4 more sources