Results 1 to 10 of about 26,553 (178)
“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 +7 more sources
Parsing Expression Grammars and Their Induction Algorithm [PDF]
Applied Sciences, 2020 Grammatical inference (GI), i.e., the task of finding a rule that lies behind given words, can be used in the analyses of amyloidogenic sequence fragments, which are essential in studies of neurodegenerative diseases.
Wojciech Wieczorek +2 more
doaj +6 more sources
Linear Parsing Expression Grammars [PDF]
, 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.
A Birman +10 more
core +7 more sources
On the Relation between Context-Free Grammars and Parsing Expression Grammars [PDF]
Science of Computer Programming, 2014 Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison.
Ierusalimschy, Roberto +2 more
core +5 more sources
Parsing Expression Grammars Made Practical [PDF]
Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, 2015 Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Laurent, Nicolas, Mens, Kim
core +7 more sources
Derivatives of Parsing Expression Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm ...
Aaron Moss
doaj +5 more sources
TRX: A Formally Verified Parser Interpreter [PDF]
Logical Methods in Computer Science, 2011 Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing
Adam Koprowski, Henri Binsztok
doaj +4 more sources
Knotify: An Efficient Parallel Platform for RNA Pseudoknot Prediction Using Syntactic Pattern Recognition [PDF]
Methods and Protocols, 2022 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 +2 more sources
الاضطرابات الفكرية في تعدد الأوجه الإعرابية
مجلة المهرة للعلوم الإنسانية, 2023 وقف الباحث على جملة من الشواهد النحوية غير المستأنسة من الفترة التي شهدت نشأة النحو وتقعيده إلى القرن الرابع الهجري، وذلك في مسألة تعدد الأوجه الإعرابية في المسألة الواحدة؛ إذ يرى فيها اضطرابًا بيِّنًا، موضِّحا أسباب ذلك الاضطراب وبواعثه التي تتجلى في ...
يحيى بن محمد بن عبدالله البلوشي
doaj +1 more source
Probabilistic mathematical formula recognition using a 2D context-free graph grammar [PDF]
, 2011 We present a probabilistic framework for the mathematical expression recognition problem. The developed system is flexible in that its grammar can be extended easily thanks to its graph grammar which eliminates the need for specifying rule precedence. It
Celik, Mehmet +3 more
core +3 more sources