scholarly journals Weak Greibach Normal Form for Hyperedge Replacement Grammars

2020 ◽  
Vol 330 ◽  
pp. 108-125
Author(s):  
Tikhon Pshenitsyn
Keyword(s):  
Normal Form ◽  
Hyperedge Replacement ◽  
Greibach Normal Form

scholarly journals On greibach normal form construction

1985 ◽  
Vol 40 ◽  
pp. 315-317 ◽  
Author(s):  
Friedrich J. Urbanek
Keyword(s):  
Normal Form ◽  
Greibach Normal Form

scholarly journals Algebraically complete semirings and Greibach normal form

2005 ◽  
Vol 133 (1-3) ◽  
pp. 173-203 ◽  
Author(s):  
Zoltán Ésik ◽  
Hans Leiß
Keyword(s):  
Normal Form ◽  
Greibach Normal Form

A Survey of Normal form Covers for Regular Grammars

1981 ◽  
Vol 4 (4) ◽  
pp. 761-776
Author(s):  
Anton Nijholt
Keyword(s):  
Normal Form ◽  
Special Form ◽  
Normal Forms ◽  
Context Free Grammar ◽  
Left Regular ◽  
Regular Grammar ◽  
Left And Right ◽  
Context Free ◽  
Greibach Normal Form

An overview is given of cover results for normal forms of regular grammars. Due to the special form of regular grammars and due to the results which are obtained it is sufficient to consider covering grammars in Greibach normal form. Among other things it is proved that any left-regular grammar can be left covered with a context-free grammar in Greibach normal form. All the cover results concerning the left- and right-regular grammars are listed, with respect to several types of covers, in a cover table.

scholarly journals LL (1) Parser versus GNF inducted LL (1) Parser on Arithmetic Expressions Grammar: A Comparative Study

2020 ◽  
Vol 18 (02) ◽  
pp. 89-101
Author(s):  
Hassan Ali ◽  
Muhammad Shumail Naveed ◽  
Dilawar Naseem ◽  
Jawaid Shabbir
Keyword(s):  
Statistical Analysis ◽  
Normal Form ◽  
Processing Speed ◽  
Statistical Significance ◽  
Transformation Method ◽  
Arithmetic Expression ◽  
Kolmogorov Smirnov ◽  
Prime Objective ◽  
Greibach Normal Form ◽  
Arithmetic Expressions

The prime objective of the proposed study is to determine the induction of Greibach Normal Form (GNF) in Arithmetic Expression Grammars to improve the processing speed of conventional LL(1) parser. Conventional arithmetic expression grammar and its equivalent LL(1) is used in the study which is converted. A transformation method is defined which converts the selected grammar into a Greibach normal form that is further converted into a GNF based parser through a method proposed in the study. These two parsers are analyzed by considering 399 cases of arithmetic expressions. During statistical analysis, the results are initially examined with the Kolmogorov-Smirnov and Shapiro-Wilk test. The statistical significance of the proposed method is evaluated with the Mann-Whitney U test. The study described that GNF based LL(1) parser for arithmetic take fewer steps than conventional LL(1) grammar. The ranks and asymptotic significance depict that the GNF based LL(1) method is significant than the conventional LL(1) approach. The study adds to the knowledge of parsers itself, parser expression grammars (PEG’s), LL(1) grammars, Greibach Normal Form (GNF) induced grammar structure, and the induction of Arithmetic PEG’s LL(1) to GNF based grammar.

Sign in / Sign up

Export Citation Format

Share Document