Filters








67,144 Hits in 2.9 sec

Global context recovery

Ajit B. Pai, Richard B. Kieburtz
1979 SIGPLAN notices  
Methods for error recovery in parsing a deterministic, context-free language need not be derived by ad hoc means.  ...  When fixed, table-driven parsing algorithms are used the error recovery procedures can also make use of knowledge about the grammar for the language, derived from the parsing tables.  ...  Any language generated by such a grammar is regular. ~] Though SPLU is a sufficient condition it is not a necessary condition for a symbol to be SFS.  ... 
doi:10.1145/872732.806966 fatcat:salfdtos7vaeznidrerjxqefm4

Page 1328 of Mathematical Reviews Vol. 48, Issue 4 [page]

1974 Mathematical Reviews  
An A-grammar is an ¢-free context-free grammar such that some of the productions are marked.  ...  Some grammars with global substitution rules. (Russian. English summary) Nauén.-Tehn. Informacija (VINITI) Ser. 2. Informa- cionnye Processy i Sistemy 1972, no. 3, 32-36, 40.  ... 

Using a Neighbourhood Graph Based on Voronoï Tessellation with DMOS, a Generic Method for Structured Document Recognition [chapter]

Aurélie Lemaitre, Bertrand Coüasnon, Ivan Leplumey
2006 Lecture Notes in Computer Science  
This association allows exploiting different aspects of the neighbourhood graph, separating the graph analysis from the knowledge linked to a kind of document, and establishing a bidirectional context-based  ...  The global recognition rate of number and surname areas is similar to the one corresponding to the previous grammar, that is to say around 99,02%.  ...  Voronoï tessellation is usually used globally on a document, which reduces its capacity of exploitation. Thanks to method DMOS, this graph can be exploited depending on the context.  ... 
doi:10.1007/11767978_24 fatcat:f2ef4hez5bcmnfvtjg5mrqs6kq

Page 2172 of Mathematical Reviews Vol. 49, Issue 6 [page]

1975 Mathematical Reviews  
programmed grammars, while the families of languages generated by leftmost, checking and global scattered-context grammars coincide with the family of context-sensitive languages.  ...  It is shown that the families of languages generated by leftmost, checking and global unordered scattered-context grammars are all subfamilies of the family of languages generated by e-free context-free  ... 

A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages

Tetsuro Matsumura, Kimio Kuramitsu
2016 Journal of Information Processing  
Nez is our extended PEG language, including symbol tables and conditional parsing.  ...  Parsing Expression Grammars are a popular foundation for describing syntax. Unfortunately, several syntax of programming languages are still hard to recognize with pure PEGs.  ...  NL WS>> // nested Note that the parsing condition is a global state and sharable across productions.  ... 
doi:10.2197/ipsjjip.24.256 fatcat:qpt2344p7rdphkg5bjsujbu6cu

A declarative extension of parsing expression grammars for recognizing most programming languages [article]

Tetsuro Matsumura, Kimio Kuramitsu
2015 arXiv   pre-print
Nez is our extended PEG language, including symbol tables and conditional parsing.  ...  Parsing Expression Grammars are a popular foundation for describing syntax. Unfortunately, several syntax of programming languages are still hard to recognize with pure PEGs.  ...  NL WS>> // nested Note that the parsing condition is a global state and sharable across productions.  ... 
arXiv:1511.08414v1 fatcat:vo26wb6ydzdofg5gcl5nolx4ma

Page 888 of Mathematical Reviews Vol. 45, Issue 3 [page]

1973 Mathematical Reviews  
An n-tuple grammar G is a structure G=(n, ©, 2, P, 8S) such that G,=(®, X,, P, 8) is a context-free grammar. The language L(@) generated by @ is L(@) ={p(z)|z e L(G,)}.  ...  An n-tuple grammar G is called unambiguous if (i) @, is unambiguous (as a context- free grammar), and (ii) the mapping ,» restricted to p: L(G,)—> L(@) is one-to-one.  ... 

Page 6512 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
A labelled pure context-free grammar (IPCF grammar for short) is a pure context-free grammar together with a bijective function from the set of rules to the set Lab of labels.  ...  The authors then introduce a new (rather technical) condition for proper alPCF grammars called the balance k-bounded property.  ... 

Page 1571 of Mathematical Reviews Vol. 55, Issue 5 [page]

1978 Mathematical Reviews  
and the so-called grammars with global and local context conditions proposed by the author and Teurich. grammars permit formalisation of identification tests, for Which purpose they contain explicit notions  ...  Chapter 4 contains less traditional topics, some classification of context conditions used in programming languages and some formalisms for their description: programmed and Van Vijn- garden’s grammars  ... 

Page 6991 of Mathematical Reviews Vol. , Issue 96k [page]

1996 Mathematical Reviews  
It is known that conditional grammars have the same power as context-sensitive grammars. “In this paper we study conditional grammars where the associ- ated regular sets have only a special form.  ...  We show that the family of context-sensitive languages is already generated by conditional grammars with fully initial or power-separating or non-counting or ordered regular languages as conditions, respectively  ... 

Run-Time Checking Multi-threaded Java Programs [chapter]

Frank S. de Boer, Stijn de Gouw
2016 Lecture Notes in Computer Science  
Although the intersection of two context-free languages is in general not contextfree, we can specify them separately by two different context-free grammars.  ...  Grammars and Interference Freedom The context-free grammar underlying an attribute grammar generates in our approach the valid histories, i.e., traces of events.  ... 
doi:10.1007/978-3-662-49192-8_18 fatcat:prsrrnso5vgunacoxmqsn3rsn4

Page 2920 of Mathematical Reviews Vol. , Issue 2000d [page]

2000 Mathematical Reviews  
Summary: “A fuzzy context-free K-grammar is a fuzzy context- free grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol a, the set containing  ...  Summary: “We continue here the study of internal contextual grammars with (global and local) maximal use of selectors.  ... 

Page 984 of Mathematical Reviews Vol. , Issue 87b [page]

1987 Mathematical Reviews  
Author summary: “A quadratic regularity test is presented for nondeleting simple deterministic context-free tree grammars as well as for nondeleting macro S grammars.”  ...  Theorem: Let 1 be any family of context-free languages which includes all of the finite sets.  ... 

A backtracking LR algorithm for parsing ambiguous context-dependent languages

Adrian D. Thurston, James R. Cordy
2006 Proceedings of the 2006 conference of the Center for Advanced Studies on Collaborative research - CASCON '06  
Parsing ambiguous computer languages requires an ability to generate a parser for arbitrary context-free grammars. In both cases we have tools for generating parsers from a grammar.  ...  Language ambiguities are resolved by prioritizing grammar declarations.  ...  Semantic Conditions and Error Recovery An advantage of a our approach is that it affords simple implementations of semantic conditions and error recovery.  ... 
doi:10.1145/1188966.1188972 dblp:conf/cascon/ThurstonC06 fatcat:pwoiaj2pzzd5foomvplegayaha

Implicit Learning of Recursive Context-Free Grammars

Martin Rohrmeier, Qiufang Fu, Zoltan Dienes, Johan J. Bolhuis
2012 PLoS ONE  
Context-free grammars are fundamental for the description of linguistic syntax.  ...  However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness  ...  Accordingly, context-free grammars include all finite-state grammars, and context-sensitive grammars include all context-free grammars and finite state grammars.  ... 
doi:10.1371/journal.pone.0045885 pmid:23094021 pmcid:PMC3477156 fatcat:di4p66u73zfq3i6hkmlwuynocu
« Previous Showing results 1 — 15 out of 67,144 results