FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4238872873> ?p ?o ?g. }

• W4238872873 abstract "Background. Context-free grammars (CFGs) and Parsing-expression Grammars (PEGs) are the two main formalisms used by formal specifications and parsing frameworks to describe programming languages. They mainly differ in the definition of the choice operator, describing language alternatives. CFGs support the use of non-deterministic choice (i.e., unordered choice), where all alternatives are equally explored. PEGs support a deterministic choice (i.e., ordered choice), where alternatives are explored in strict succession. In practice the two formalisms, are used through concrete classes of parsing algorithms (such as Left-to-right, rightmost derivation (LR) for CFGs and Packrat parsing for PEGs), that follow the semantics of the formal operators. Problem Statement. Neither the two formalisms, nor the accompanying algorithms are sufficient for a complete description of common cases arising in language design. In order to properly handle ambiguity, recursion, precedence or associativity, parsing frameworks either introduce implementation specific directives or ask users to refactor their grammars to fit the needs of the framework/algorithm/formalism combo. This introduces significant complexity even in simple cases and results in incompatible grammar specifications. Our Proposal. We introduce Multi-Ordered Grammars (MOGs) as an alternative to the CFG and PEG formalisms. MOGs aim for a better exploration of ambiguity, ordering, recursion and associativity during language design. This is achieved by (a) allowing both deterministic and non-deterministic choices to co-exist, and (b) introducing a form of recursive and scoped ordering. The formalism is accompanied by a new parsing algorithm (Gray) that extends chart parsing (normally used for Natural Language Processing) with the proposed MOG operators. Results. We conduct two case-studies to assess the expressiveness of MOGs, compared to CFGs and PEGs. The first consists of two idealized examples from literature (an expression grammar and a simple procedural language). The second examines a real-world case (the entire Smalltalk grammar and eleven new Smalltalk extensions) probing the complexities of practical needs. We show that in comparison, MOGs are able to reduce complexity and naturally express language constructs, without resorting to implementation specific directives. Conclusion. We conclude that combining deterministic and non-deterministic choices in a single gram- mar specification is indeed not only possible but also beneficial. Moreover, augmented by operators for recursive and scoped ordering the resulting multi-ordered formalism presents a viable alternative to both CFGs and PEGs. Concrete implementations of MOGs can be constructed by extending chart parsing with MOG operators for recursive and scoped ordering." @default.
• W4238872873 created "2022-05-12" @default.
• W4238872873 creator A5028331572 @default.
• W4238872873 date "2019-01-05" @default.
• W4238872873 modified "2023-09-25" @default.
• W4238872873 title "Parsing multi-ordered grammars with the Gray algorithm" @default.
• W4238872873 doi "https://doi.org/10.7287/peerj.preprints.27465v1" @default.
• W4238872873 hasPublicationYear "2019" @default.
• W4238872873 type Work @default.
• W4238872873 citedByCount "0" @default.
• W4238872873 crossrefType "posted-content" @default.
• W4238872873 hasAuthorship W4238872873A5028331572 @default.
• W4238872873 hasBestOaLocation W42388728731 @default.
• W4238872873 hasConcept C11413529 @default.
• W4238872873 hasConcept C146072743 @default.
• W4238872873 hasConcept C146810361 @default.
• W4238872873 hasConcept C147547768 @default.
• W4238872873 hasConcept C154945302 @default.
• W4238872873 hasConcept C166651950 @default.
• W4238872873 hasConcept C168773036 @default.
• W4238872873 hasConcept C171018156 @default.
• W4238872873 hasConcept C186644900 @default.
• W4238872873 hasConcept C199360897 @default.
• W4238872873 hasConcept C2524010 @default.
• W4238872873 hasConcept C2780522230 @default.
• W4238872873 hasConcept C33923547 @default.
• W4238872873 hasConcept C41008148 @default.
• W4238872873 hasConcept C42560504 @default.
• W4238872873 hasConcept C53893814 @default.
• W4238872873 hasConcept C60690694 @default.
• W4238872873 hasConcept C67621940 @default.
• W4238872873 hasConcept C80444323 @default.
• W4238872873 hasConcept C97212296 @default.
• W4238872873 hasConceptScore W4238872873C11413529 @default.
• W4238872873 hasConceptScore W4238872873C146072743 @default.
• W4238872873 hasConceptScore W4238872873C146810361 @default.
• W4238872873 hasConceptScore W4238872873C147547768 @default.
• W4238872873 hasConceptScore W4238872873C154945302 @default.
• W4238872873 hasConceptScore W4238872873C166651950 @default.
• W4238872873 hasConceptScore W4238872873C168773036 @default.
• W4238872873 hasConceptScore W4238872873C171018156 @default.
• W4238872873 hasConceptScore W4238872873C186644900 @default.
• W4238872873 hasConceptScore W4238872873C199360897 @default.
• W4238872873 hasConceptScore W4238872873C2524010 @default.
• W4238872873 hasConceptScore W4238872873C2780522230 @default.
• W4238872873 hasConceptScore W4238872873C33923547 @default.
• W4238872873 hasConceptScore W4238872873C41008148 @default.
• W4238872873 hasConceptScore W4238872873C42560504 @default.
• W4238872873 hasConceptScore W4238872873C53893814 @default.
• W4238872873 hasConceptScore W4238872873C60690694 @default.
• W4238872873 hasConceptScore W4238872873C67621940 @default.
• W4238872873 hasConceptScore W4238872873C80444323 @default.
• W4238872873 hasConceptScore W4238872873C97212296 @default.
• W4238872873 hasLocation W42388728731 @default.
• W4238872873 hasOpenAccess W4238872873 @default.
• W4238872873 hasPrimaryLocation W42388728731 @default.
• W4238872873 hasRelatedWork W1560736395 @default.
• W4238872873 hasRelatedWork W1587751993 @default.
• W4238872873 hasRelatedWork W2039335886 @default.
• W4238872873 hasRelatedWork W2099269319 @default.
• W4238872873 hasRelatedWork W2113112210 @default.
• W4238872873 hasRelatedWork W2152096446 @default.
• W4238872873 hasRelatedWork W2799940024 @default.
• W4238872873 hasRelatedWork W2943197582 @default.
• W4238872873 hasRelatedWork W4233491444 @default.
• W4238872873 hasRelatedWork W4238872873 @default.
• W4238872873 isParatext "false" @default.
• W4238872873 isRetracted "false" @default.
• W4238872873 workType "article" @default.