Results 31 to 40 of about 51,328 (185)
Left recursion in Parsing Expression Grammars [PDF]
Las gramáticas de expresión de análisis (PEG) son un formalismo que puede describir todos los lenguajes libres de contexto deterministas a través de un conjunto de reglas que especifican un analizador de arriba hacia abajo para algún lenguaje. Los PEG son fáciles de usar y hay implementaciones eficientes de bibliotecas de PEG en varios lenguajes de ...
Sérgio Queiróz de Medeiros+2 more
openalex +6 more sources
The formalization and implementation of Adaptable Parsing Expression Grammars
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
Automatic Syntax Error Reporting and Recovery in Parsing Expression Grammars [PDF]
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 Queiróz de Medeiros+2 more
+9 more sources
A text pattern‐matching tool based on Parsing Expression Grammars [PDF]
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
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
الاضطرابات الفكرية في تعدد الأوجه الإعرابية
وقف الباحث على جملة من الشواهد النحوية غير المستأنسة من الفترة التي شهدت نشأة النحو وتقعيده إلى القرن الرابع الهجري، وذلك في مسألة تعدد الأوجه الإعرابية في المسألة الواحدة؛ إذ يرى فيها اضطرابًا بيِّنًا، موضِّحا أسباب ذلك الاضطراب وبواعثه التي تتجلى في ...
يحيى بن محمد بن عبدالله البلوشي
doaj +1 more source
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala
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
Obtaining valuable clues for noncoding RNA (ribonucleic acid) subsequences remains a significant challenge, acknowledging that most of the human genome transcribes into noncoding RNA parts related to unknown biological operations.
Christos Andrikos+5 more
doaj +1 more source
Grammar-Supervised End-to-End Speech Recognition with Part-of-Speech Tagging and Dependency Parsing
For most automatic speech recognition systems, many unacceptable hypothesis errors still make the recognition results absurd and difficult to understand.
Genshun Wan+5 more
semanticscholar +1 more source
Syntax-Aware Network for Handwritten Mathematical Expression Recognition [PDF]
Handwritten mathematical expression recognition (HMER) is a challenging task that has many potential applications. Recent methods for HMER have achieved outstanding performance with an encoder-decoder architecture.
Ye Yuan+6 more
semanticscholar +1 more source