A context-free parsing algorithm using heuristic search

2002 ◽  
Author(s):  
A.L.N. Fred ◽  
J.M.N. Leitao
Keyword(s):  
Heuristic Search ◽  
Parsing Algorithm ◽  
Context Free

An efficient context-free parsing algorithm

1983 ◽  
Vol 26 (1) ◽  
pp. 57-61 ◽  
Author(s):  
Jay Earley
Keyword(s):  
Parsing Algorithm ◽  
Context Free

scholarly journals Parsing multi-ordered grammars with the Gray algorithm

2019 ◽  
Author(s):  
Nick Papoulias
Keyword(s):  
Programming Languages ◽  
Language Processing ◽  
Language Design ◽  
Formal Specifications ◽  
Problem Statement ◽  
Language Constructs ◽  
Chart Parsing ◽  
Parsing Algorithm ◽  
Definition Of ◽  
Context Free

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 grammar 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.

scholarly journals Tunnel Parsing with counted repetitions

2020 ◽  
Vol 21 (4) ◽  
Author(s):  
Nikolay Handzhiyski ◽  
Elena Somova
Keyword(s):  
Efficient Algorithm ◽  
Time Complexity ◽  
Linear Time ◽  
Domain Specific Languages ◽  
Context Free Grammar ◽  
Syntax Tree ◽  
Domain Specific ◽  
Concrete Syntax ◽  
Parsing Algorithm ◽  
Context Free

The article describes a new and efficient algorithm for parsing, called Tunnel Parsing, that parses from left to right on the basis of a context-free grammar without left recursion and rules that recognize empty words. The algorithm is applicable mostly for domain-specific languages. In the article, particular attention is paid to the parsing of grammar element repetitions. As a result of the parsing, a statically typed concrete syntax tree is built from top to bottom, that accurately reflects the grammar. The parsing is not done through a recursion, but through an iteration. The Tunnel Parsing algorithm uses the grammars directly without a prior refactoring and is with a linear time complexity for deterministic context-free grammars.

scholarly journals Parsing multi-ordered grammars with the Gray algorithm

2019 ◽  
Author(s):  
Nick Papoulias
Keyword(s):  
Programming Languages ◽  
Language Processing ◽  
Language Design ◽  
Formal Specifications ◽  
Problem Statement ◽  
Language Constructs ◽  
Chart Parsing ◽  
Parsing Algorithm ◽  
Definition Of ◽  
Context Free

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.

Watson–Crick Context-Free Grammars: Grammar Simplifications and a Parsing Algorithm

2018 ◽  
Vol 61 (9) ◽  
pp. 1361-1373
Author(s):  
Nurul Liyana Mohamad Zulkufli ◽  
Sherzod Turaev ◽  
Mohd Izzuddin Mohd Tamrin ◽  
Azeddine Messikh
Keyword(s):  
Parsing Algorithm ◽  
Context Free ◽  
Context Free Grammars
Sign in / Sign up

Export Citation Format

Share Document