Filters








1,933 Hits in 6.6 sec

Duplication Grammars

Carlos Martín-Vide, Gheorghe Paun
1999 Acta Cybernetica  
In this context, we also solve a problem left open in a paper by Dassow and Mitrana, [1], even giving a stronger results: the iterated duplication with rules of only one type (see formal definitions in  ...  Motivated by the abundance of duplication operations appearing in natural languages and in the genetic area, we introduce a generative mechanism based on duplication operations: one starts from a given  ...  It is not decidable whether or not a context-free language is in a family DUPL(a), for any a G {I,r,0,lr,l0,r0,lr0}. Proof.  ... 
dblp:journals/actaC/Martin-VideP99 fatcat:2h26feg74felfbfi5tlta5mbcu

Simple chain grammars and languages

Anton Nijholt
1979 Theoretical Computer Science  
A subclass of the LR(O)-grammars, the class of simple chain grammars is introduced.  ...  Although there exist simpio chain grammars which are not LL(k) for any k > 0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars.  ...  Verbeek for introducing me to the issues of parsing and covers. I wish to thank the referees for many helpful suggestions.  ... 
doi:10.1016/0304-3975(79)90032-x fatcat:bwabljqtmbhnvbxdejledz6ke4

Generating parsers for BNF grammars

Franklin L. Deremer
1969 Proceedings of the May 14-16, 1969, spring joint computer conference on XX - AFIPS '69 (Spring)  
HI I Lh Ht (4) since sections Ph, Fh, and Th are identical, and are a, subset of section Eh, all these could have been com-  ...  As an example of a grammar requiring both lookahead and look-back consider the following LR (2) grammar.  ...  left part of the production and activate section M t to decide how to continue the parse. 4. if p = 0 and therefore the right part of the production is empty, then the parser should "unscan" the top symbol  ... 
doi:10.1145/1476793.1476928 dblp:conf/afips/Deremer69 fatcat:m3zyn6qw65dmfoplaioe5wi4c4

Operator precedence for data-dependent grammars

Ali Afroozeh, Anastasia Izmaylova
2016 Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2016  
Constructing parsers based on declarative specification of operator precedence is a very old research topic, and there are various existing approaches.  ...  We implemented our approach using Iguana, a data-dependent parsing framework, and evaluated it by parsing Java and OCaml source files.  ...  Acknowledgments We are thankful to Eelco Visser and the anonymous reviewers for their constructive feedback on earlier versions of this paper.  ... 
doi:10.1145/2847538.2847540 dblp:conf/pepm/AfroozehI16 fatcat:2ac6y43wsrakzdmvknqmezqj7e

Parsing a Lattice with Multiple Grammars

Fuliang Weng, Helen Meng, Po-Chui Luk
2000 International Workshop/Conference on Parsing Technologies  
Motivated by these concerns, [25] proposed a grammar partitioning and top-down parser composition mechanism for loosely restricted Context-Free Grammars (CFGs).  ...  rule-based grammar partition in a lattice framework, and 3) initial but encouraging parsing results for Chinese and English queries from an Air Travel Information System {ATIS) corpus.  ...  This work is mostly supported by the Direct Grant from the Chinese University of Hong Kong, and, in part, supported by SRI International, under Mediated Space project.  ... 
dblp:conf/iwpt/WengML00 fatcat:yjr4qqzi2zhrxcynkaqb2mpfle

Machines for attribute grammars

Gilberto Filé
1986 Information and Control  
Their class of tree-to-value translations seems instead to be larger than that of attribute grammars and the difference is overcome by means of (a special type of) context-free grammar interpretations.  ...  Two automata models are introduced that play, with respect to attribute grammars and attribute-evaluation for them, the same role as pushdown automata have with respect to context-free grammars and their  ...  In this section we show results that concern both point (i) and (ii) above.  ... 
doi:10.1016/s0019-9958(86)80043-2 fatcat:vzthkrxaj5ecll4sr3dwydk6qq

Strict deterministic grammars

Michael A. Harrison, Ivan M. Havel
1973 Journal of computer and system sciences (Print)  
A grammatical definition of a family of deterministic context free languages is presented. It is very easy to decide if a context free grammar is strict deterministic.  ...  A characterization theorem involving pushdown automata is proved, and it follows that the strict deterministic languages are coextensive with the family of prefix free deterministic languages.  ...  of LR(k) grammars [12] .  ... 
doi:10.1016/s0022-0000(73)80008-x fatcat:qjvbravfejahrp57fl4ikskswm

Phrase parsers from multi-axiom grammars

Teodor Rus, James S. Jones
1998 Theoretical Computer Science  
In contrast, the parser we are developing here results from the layering of the grammar rules in a preprocessing phase, set no restrictions of the form of specification rules, and its complexity is linear  ...  But it requires the specification rules to be in Chomsky normal form and its complexity is 0(n3).  ...  These improvements extend from making the paper more readable, to comparing our research with other similar ideas used in parsing technology, such as [ 19, 26, 28] , and finally to providing a first evaluation  ... 
doi:10.1016/s0304-3975(97)00273-9 fatcat:xof3bxpcfzcvrnzf6czqcziinq

Parsing Non-LR(k) grammars with yacc

Gary H. Merrill
1993 Software, Practice & Experience  
This paper describes a set of minor modifications to yacc-like tools that allows them to be used in a straightforward way to parse ambiguities and, more generally, grammars that require an indefinite amount  ...  Of the parser generating tools currently in use, yacc (or one of its several variants) is perhaps the most frequently employed.  ...  and power. parsing non-lr(k) grammars SUMMARY What can be said about the utility of this approach to parsing non-LR(k) grammars?  ... 
doi:10.1002/spe.4380230803 fatcat:nyvdvruxvbhzbdub75yjgpesca

A Modified Earley Parser for Huge Natural Language Grammars

Sinan Polat, Merve Selcuk-Simsek, Ilyas Cicekli
2016 Research in Computing Science  
According to our evaluation results, our modified parser has a time bound of O(log(R)N 3 ), and it has 20% less memory usage regarding the original Earley parser.  ...  For almost a half century Earley parser has been used in the parsing of context-free grammars and it is considered as a touch-stone algorithm in the history of parsing algorithms.  ...  Later Aycock and Horspool stated look-ahead's necessity was controversial [10] . Because we seek for speed, we decide not to use to look-ahead which defines our parser as an LR(0) parser.  ... 
doi:10.13053/rcs-117-1-2 fatcat:zhnih5zz7bacnnbdtjguzhzin4

On parsing two-level grammars

Lutz Michael Wegner
1980 Acta Informatica  
The author wishes to acknowledge the detailed recommendations of the referees which helped to make the presentation more concise and readable.  ...  Major results concerning their formal properties were obtained by Sintzoff [17] , Baker [4] , Greibach [9] and Deussen [6, 71 .  ...  [16] , p. 283 -but we are mostly interested in practical subclasses of CFLs such as LR(k) and LL(k) for some fixed k which we can always decide).  ... 
doi:10.1007/bf00288543 fatcat:x3gejcdd4vdwvael5zynqpdqcu

Packrat parsers can handle practical grammars in mostly constant space

Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
2010 Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '10  
Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily than the traditional LL(k) or LR(1) parsing algorithms.  ...  Experiments showed that parsers generated from cut-inserted grammars can parse Java programs and subset XML files in bounded space.  ...  In contrast, packrat parsers can handle complicated grammars more easily than traditional LL and LR parsers.  ... 
doi:10.1145/1806672.1806679 dblp:conf/paste/MizushimaMY10 fatcat:f37aznrryjaulnhtd5gqufqr44

Choosing Grammars to Support Language Processing Courses

Maria João Varanda Pereira, Nuno Oliveira, Daniela Da Cruz, Pedro Rangel Henriques, Marc Herbstritt
2013 Symposium on Languages, Applications and Technologies  
The most important ones concern chronological order, and age-related issues. Regarding this simple domain, the researchers decided to build a language capable of specifying each family.  ...  Course Contents Now we can list the main topics that must be included in the contents of any LP course: Programming (1) ); Bottom-Up Parsing, BU (LR(0), LR(1), SLR(1), LALR (1) ).  ... 
doi:10.4230/oasics.slate.2013.155 dblp:conf/slate/PereiraOCH13 fatcat:5jk5yn6unrgmrcyr75ob6jeq5u

Silver: An extensible attribute grammar system

Eric Van Wyk, Derek Bodin, Jimin Gao, Lijesh Krishnan
2010 Science of Computer Programming  
The result is an attribute grammar specification language with a rich set of language features.  ...  One practical obstacle to their adoption is a perceived lack of both domain-specific and general purpose language features needed to address the many different aspects of a problem.  ...  Acknowledgements This work is partially funded by the McKnight Foundation and the National Science Foundation via NSF CAREER Award #0347860 and NSF CCF Award #0429640.  ... 
doi:10.1016/j.scico.2009.07.004 fatcat:azzj4oj4ojhpbprtlcgcnxruzm

Adaptable Parsing Expression Grammars [chapter]

Leonardo Vieira dos Santos Reis, Roberto da Silva Bigonha, Vladimir Oliveira Di Iorio, Luis Eduardo de Souza Amorim
2012 Lecture Notes in Computer Science  
A Dynamic Grammar is a tuple (M, G 0 ), where M is a Turing machine and G 0 is the initial grammar.  ...  and one attribute expression, x 0 ).  ...  this work was the current lack of appropriate models for the definition and implementation of features for allowing on-the-fly modification of the grammar rules.  ... 
doi:10.1007/978-3-642-33182-4_7 fatcat:nrlhxpg2mzce7n5oa3bqsakoye
« Previous Showing results 1 — 15 out of 1,933 results