Filters








2,413 Hits in 2.9 sec

Attribute-influenced LR parsing [chapter]

Neil D. Jones, Michael Madsen
1980 Lecture Notes in Computer Science  
Methods are described which make it possibie~ when given an arbitrary attribute grammar (or AG)~ t. 2,. 3. to analyze the AG to determine which of its attributes may be computed during LR parsing; to augment  ...  the parser with instructions and data structures to compute many attributes during parsing; to use attribute values to assist the parsing process (e.g. to use symbol table information to decide whether  ...  Our approach evaluates attributes during LR parsing, based on a preliminary analysis of the structure of the LR parse tables and the AG.  ... 
doi:10.1007/3-540-10250-7_30 fatcat:eeyaruustnbfdbh67vvtmndyzu

Attribute-Influenced LR Parsing

Neil D. Jones, Michael Madsen
1980 DAIMI Report Series  
<p>Methods are described which make it possible, when given an arbitrary attribute grammar (or AG),</p><ol> <li> to analyze the AG to determine which of its attributes may be computed during LR parsing  ...  ; </li><li> to augment the parser with instructions and data structures to compute many attributes during parsing; </li><li> to use attribute values to assist the parsing process (e.g. to use symbol table  ...  Our approach evaluates attributes during LR parsing, based on a preliminary analysis of the structure of the LR parse tables and the AG.  ... 
doi:10.7146/dpb.v9i119.6537 fatcat:zuzlpxatufez5acrx7an47xlqi

Rule splitting and attribute-directed parsing [chapter]

David A. Watt
1980 Lecture Notes in Computer Science  
Implementations of rule splitting (attribute-directed parsing) are demonstrated for top-down and bottom-up parsers, both one-pass and multi-pass.  ...  Rule splitting is a phenomenon, most clearly exhibited by attribute grammars and affix grammars, in which the syntactic structure of a phrase is constrained by its attributes.  ...  The attributes do not in any way influence the flow of control in the parser.Rule splitting, however, makes it feasible for the attributes concerned to influence the behaviour of the parser.  ... 
doi:10.1007/3-540-10250-7_29 fatcat:h5y7gfxwrvfevaxowjbdw5ugfu

Rie, a compiler generator based on a one-pass-type attribute grammar

Masataka Sassa, Harushi Ishizuka, Ikuo Nakata
1995 Software, Practice & Experience  
LR-attributed grammars are one class of attribute grammars in which attribute evaluation can be performed in one pass during LR parsing without creating a parse tree.  ...  Rie was developed based on a variant of an LR-attributed grammar called ECLR-attributed grammar (equivalence class LR-attributed grammar), in which equivalence relations are introduced into the LR-attributed  ...  LR-attributed grammar LR-attributed grammars are a class of attribute grammars in which attribute evaluation can be performed simultaneously with LR parsing without creating a parse tree.  ... 
doi:10.1002/spe.4380250302 fatcat:fkt5uf6bp5bkfp66y66jquciwq

Issues in Implementation of Parallel Parsing on Multi-Core Machines

Amit Barve, Brijendra Kumar Joshi
2014 International Journal of Computer Science Engineering and Information Technology  
The advent of multi-core architecture has highly influenced the area of high performance computing.  ...  But it is difficult to implement the same technique in parsing phase. This paper highlights some issues related to implementation of parallel parsing on multi-core machines.  ...  Bottom-up parsing includes some algorithms like Simple LR (SLR) parsing, Canonical LR (CLR) parsing, and Look Ahead LR (LALR) parsing.  ... 
doi:10.5121/ijcseit.2014.4505 fatcat:t42btn7mt5ak7dmjgga3l7m52q

Incremental generation of parsers

J. Heering, P. Klint, J. Rekers
1989 SIGPLAN notices  
An LR-based parser generator for arbitrary context-free grammars is described, which generates parsers by need and processes grammar modifications by updating already existing parsers.  ...  ","3+ "3" -> Attributes --empty ---> Attributes "bracket" -> Attribute "assoc" -> Attribute "Lef t-assoc" -> Attribute "right-assoc" "non-assoc" -> Attribute -> Attribute end SDF Fig. 1 : 1 Comparison  ...  l Pseudo-parallel LR parsing [Lan74, Tom85, Rek89] This is an extended LR parsing algorithm, that requires a conventional (but possibly ambiguous) LR(0) or LR(1) parse table.  ... 
doi:10.1145/74818.74834 fatcat:xgjbzodzcbfjtdomsz7bytvja4

IDS alerts correlation using grammar-based approach

Safaa O. Al-Mamory, Hongli Zhang
2008 Journal in Computer Virology  
The modified LR parser depends on these ACF-grammars to generate parse trees.  ...  Different from most other alert correlation methods, our approach treats the alerts as tokens and uses modified version of the LR parser to generate parse trees representing the scenarii in the alerts.  ...  Synthesized attributes can be evaluated by the LR parser as the input is being parsed.  ... 
doi:10.1007/s11416-008-0103-3 fatcat:3rbm3yerwbaqjeq3z3py5yv35q

Incremental analysis of real programming languages

Tim A. Wagner, Susan L. Graham
1997 SIGPLAN notices  
Our algorithm combines Tomita's generalized LR parser with reuse of entire subtrees via state-matching.  ...  However, the formal model of the language is often inadequate; in particular, LR(k) grammars are unable to describe the natural syntax of many languages, such as C ++ and Fortran, which are inherently  ...  Attribute-influenced parsing [10, 21] is a combination of LR parsing and a restricted class of attribute grammars that addresses the same problem in a formal way.  ... 
doi:10.1145/258916.258920 fatcat:tk4or7kxrnejjlqqtru6tzsnae

Incremental analysis of real programming languages

Tim A. Wagner, Susan L. Graham
1997 Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97  
Our algorithm combines Tomita's generalized LR parser with reuse of entire subtrees via state-matching.  ...  However, the formal model of the language is often inadequate; in particular, LR(k) grammars are unable to describe the natural syntax of many languages, such as C ++ and Fortran, which are inherently  ...  Attribute-influenced parsing [10, 21] is a combination of LR parsing and a restricted class of attribute grammars that addresses the same problem in a formal way.  ... 
doi:10.1145/258915.258920 dblp:conf/pldi/WagnerG97 fatcat:6sdjeqocpjc55f5bskjh4pkiuu

How to cover a grammar

René Leermakers
1989 Proceedings of the 27th annual meeting on Association for Computational Linguistics -  
Attribute evaluation may lead to the rejection of certain parse trees that are correct for the grammar without attributes.  ...  Note, however, that predict functions may influence the relation between grammar size and average parse matrix content, as some grammars may allow more restrictive predict functions then others.  ... 
doi:10.3115/981623.981640 dblp:conf/acl/Leermakers89 fatcat:ehb7wksksjg65fybnxxhz5uoem

A tool box for compiler construction [chapter]

J. Grosch, H. Emmelmann
1991 Lecture Notes in Computer Science  
Acknowledgement It hank Dr.T homas Herter for the stimulation of the implementation of trial parsing and for many fruitful discussions.  ...  conflicts -p rocesses LALR(2) and LR(1) grammars -s upports backtracking for parsing non-LR(k) languages -o ffers semantic predicates for the control of parsing by conditions -s upports named attributes  ...  Only the influence of semantic predicates on parsing motivates reparsing because this way adifferent parsing result can be achievedfrom additional passes.  ... 
doi:10.1007/3-540-53669-8_77 fatcat:ajbcz6ouszdyromyzmbiasv27a

Page 5209 of Mathematical Reviews Vol. , Issue 81M [page]

1981 Mathematical Reviews  
Applications of the algorithms to attribute grammars and automatic indentation are discussed.” Purdom, Paul Walton, Jr.; Brown, Cynthia A. Parsing extended LR(k) grammars.  ...  Authors’ summary: “An extended LR(k) [ELR(k)} grammar is a context-free grammar in which the right sides of -he productions are regular expressions and which can be parsed from left to right with k symbol  ... 

Generators for high-speed front-ends [chapter]

Josef Grosch
1989 Lecture Notes in Computer Science  
The generator provides a mechanism for S-attribution, that is synthesized attributes can be computed during parsing.  ...  In case of LR-conflicts, unlike other tools, La/r prorides not only information about an internal state consisting of a set of items but it prints a derivation tree which is much more tLseful to analyze  ...  LR-Conflict Message To ease in locating the reason for LR-conflicts we adopted the method proposed by [DeP82] .  ... 
doi:10.1007/3-540-51364-7_6 fatcat:v3tzr4trpvdc3iiotyrijnkh5y

Faster Scannerless GLR Parsing [chapter]

Giorgios Economopoulos, Paul Klint, Jurgen Vinju
2009 Lecture Notes in Computer Science  
In this paper we investigate the application of the Right-Nulled Generalized LR parsing algorithm (RNGLR) to scannerless parsing.  ...  We adapt the Scannerless Generalized LR parsing and filtering algorithm (SGLR) to implement the optimizations of RNGLR.  ...  RNGLR introduces a modified LR parse table: an RN table.  ... 
doi:10.1007/978-3-642-00722-4_10 fatcat:sdssqerwkzf6pfrpolazogwtyi

Tolerant parsing using modified LR(1) and LL(1) algorithms with embedded "Any" symbol

A.V. Goloveshkin
2019 Proceedings of the Institute for System Programming of RAS  
Specific error recovery algorithms are presented both for LL and LR tolerant parsing.  ...  To work with this concept, a standard LL(1) parsing algorithm was modified and LanD parser generator was developed. In the paper, "Any"-based modification is described for LR(1) parsing algorithm.  ...  In Section 4.3.2, the influence of this backtracking on parsing algorithm time complexity is analyzed.  ... 
doi:10.15514/ispras-2019-31(3)-1 fatcat:hgh5b6nxgrfzpbtmubzs23rbci
« Previous Showing results 1 — 15 out of 2,413 results