Filters








18,520 Hits in 2.4 sec

Self-embedding indexed grammars

R. Parchmann, J. Duske
1986 Theoretical Computer Science  
The notion 'self-embedding' is defined for (right-linear, linear) indexed grammars and languages, and it is shown that non self-embedding (fight-linear, linear) indexed languages are exactly the (right-linear  ...  A (right-linear, linear) indexed language is called self-embedding if every (fight-linear, linear) indexed grammar generating L is self-embedding.  ...  Remark. (1) If G = (N, T, I, P, S) is an indexed grammar with I = ~, then G is non self-embedding. (2) It is decidable whether an indexed grammar G = (N, T, I, P, S) is self-embedding.  ... 
doi:10.1016/0304-3975(86)90147-7 fatcat:lupdtlbjtnhspmj74yhoohaevi

Online Self-Indexed Grammar Compression [article]

Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto
2015 arXiv   pre-print
In this paper, we present the first online self-indexed grammar compression named OESP-index that can gradually build the index structure by reading input characters one-by-one.  ...  Although several grammar-based self-indexes have been proposed thus far, their applicability is limited to offline settings where whole input texts are prepared, thus requiring to rebuild index structures  ...  Conclusion We have presented OESP-index, an online self-indexed grammar compression. OESP-index is the first method for building grammar-based self-indexes in an online manner.  ... 
arXiv:1507.00805v2 fatcat:v75xwzjrdvaxvhf7rnwonvs3xm

Improved ESP-index: a practical self-index for highly repetitive texts [article]

Yoshimasa Takabatake, Yasuo Tabei, Hiroshi Sakamoto
2014 arXiv   pre-print
ESP-index is a grammar-based self-index on the notion of edit-sensitive parsing (ESP), an efficient parsing algorithm that guarantees upper bounds of parsing discrepancies between different appearances  ...  While several self-indexes for highly repetitive texts exist, developing a practical self-index applicable to real world repetitive texts remains a challenge.  ...  Martínez-Prieto for providing us with a source code of SLP-index.  ... 
arXiv:1404.4972v2 fatcat:7oxf5r4omza4dpli7ccabsxxgq

Cap expressions for context-free languages

M.K. Yntema
1971 Information and Control  
Furthermore there are effective procedures for finding a cap expression from a context-free grammar and vice versa.  ...  Then L(G~) = (P(¢O)," It is known that if a grammar G has no self-embedding variables then L(G) is regular.  ...  It may be that a is no longer self-embedding after 13 is primed. 643#8/4-2 If the only self-embedding variables that are primed are those that generate themselves more than once in the same word, the  ... 
doi:10.1016/s0019-9958(71)90419-0 fatcat:d23xdjajdbdnldmpr7l3t5tv7u

TreeGen: A Tree-Based Transformer Architecture for Code Generation

Zeyu Sun, Qihao Zhu, Yingfei Xiong, Yican Sun, Lili Mou, Lu Zhang
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
TreeGen uses the attention mechanism of Transformers to alleviate the long-dependency problem, and introduces a novel AST reader (encoder) to incorporate grammar rules and AST structures into the network  ...  Position and Depth Embeddings. Since our AST reader would use self-attention mechanisms, we need to represent the position where a grammar rule is used.  ...  + 1] = sin((i + b)/(10000 2j/d )) (4) where p i,b [·] indexes a dimension of the vector p i,b , and d is the number of dimensions (i.e., embedding size).  ... 
doi:10.1609/aaai.v34i05.6430 fatcat:it3rekqdzfb53nu4676kdbuyqy

TreeGen: A Tree-Based Transformer Architecture for Code Generation [article]

Zeyu Sun and Qihao Zhu and Yingfei Xiong and Yican Sun and Lili Mou and Lu Zhang
2019 arXiv   pre-print
TreeGen uses the attention mechanism of Transformers to alleviate the long-dependency problem, and introduces a novel AST reader (encoder) to incorporate grammar rules and AST structures into the network  ...  Position and Depth Embeddings. Since our AST reader would use self-attention mechanisms, we need to represent the position where a grammar rule is used.  ...  + 1] = sin((i + b)/(10000 2j/d )) (4) where p i,b [·] indexes a dimension of the vector p i,b , and d is the number of dimensions (i.e., embedding size).  ... 
arXiv:1911.09983v2 fatcat:vy7b7frcxfa6dhd4nxwfjfbcyy

Parsing with C++ deferred expressions

Damian Conway
1994 SIGPLAN notices  
A technique for constructing embedded grammar-based parsers in C++ was described in [1] .  ...  This paper presents an extension to that technique which allows parsing actions to be specified directly as part of the grammar, rather than indirectly (as function calls).  ...  Such "expression" objects can then be included as part of an embedded grammar.  ... 
doi:10.1145/185009.185011 fatcat:hozbrgdfwrfvvjh6tul4si3aiq

Page 5131 of Mathematical Reviews Vol. , Issue 92i [page]

1992 Mathematical Reviews  
68Q50 Aizawa, Kunio (J-HROSE-A); Nakamura, Akira [Nakamura, Akira'] (J-HROSE-A) Graph grammars with path-controlled embedding.  ...  Summary: “We define graph grammars, called node-replacement graph grammars with path-controlled embedding (nPCE gram- mars), which use a sequence of edges instead of a single edge to embed a newly replaced  ... 

Macros for context-free grammars

Peter Thiemann, Matthias Neubauer
2008 Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming - PPDP '08  
The analysis is based on an intuitive notion of self-embedding nonterminals, which is easy to check by hand and which gives the expected answer for all examples that we tried.  ...  Fischer's macro grammars provide the equivalent of procedural abstraction by extending context-free grammars with macrolike productions.  ...  Because of the choice of t and p, d = α(t; p) is self-embedding in position i. By niteness of the abstraction, there is a nite power of d which is idempotent (each power is also self-embedding).  ... 
doi:10.1145/1389449.1389465 dblp:conf/ppdp/ThiemannN08 fatcat:7mvfyc3tnnet5fqwmud3ik44ga

Syntactic complexity

Barry K. Rosen
1974 Information and Control  
Every grammar for such a language must have at least one nonterminal A which is self-embedding: there are nonnull strings 6 and ~b such that 6A~b is derivable from A (Chomsky, 1959, Theorem 11) .  ...  . | CONCLUSIONS We defined the familiar measures depth, nesting, and self-embedding.  ... 
doi:10.1016/s0019-9958(74)80058-6 fatcat:r6mzjhtiffh5veztkkifbfpe3y

Subject index

1964 Information and Control  
Gala- NETTI 504 Free Recall of Self-Embedded Eng- lish Sentences, GEORGE A. MILLER AND STEPHEN ISARD 292 P Pattern Recognition.  ...  SOLOMONOFF 225 L Languages Linear Grammars, On a Family of, V. AMAR AN~ G.  ... 
doi:10.1016/s0019-9958(64)90213-x fatcat:thz3kyfbwzazng3bkgtuibrxse

Learning Deep Semantic Model for Code Search using CodeSearchNet Corpus [article]

Chen Wu, Ming Yan
2022 arXiv   pre-print
In this paper, we propose a novel deep semantic model which makes use of the utilities of not only the multi-modal sources, but also feature extractors such as self-attention, the aggregated vectors, combination  ...  There exist many different ways for aggregating the variable length of code or query tokens into a learnable embedding, including bi-encoder, cross-encoder, and poly-encoder.  ...  indexing.  ... 
arXiv:2201.11313v1 fatcat:er5p53ejsbenjaywdppdrhtcyu

Page 1501 of Linguistics and Language Behavior Abstracts: LLBA Vol. 26, Issue 3 [page]

1992 Linguistics and Language Behavior Abstracts: LLBA  
subject index Canadian French Canada’s languages’ spatial pattern changes/stability, 1971-1981, En- glish/French/native languages; 9207163 Franco-/Anglophone marriages, childrearing experiences, Canada  ...  adult literacy students’ lives, 3-year case studies, Bible reading motivation; 9205536 sensorial aphasia’s syntactic/semantic aspects, deficits /strategies; 9207493 sixth graders’ reading community, self-definition  ... 

Author index volume 88 (1991)

1991 Theoretical Computer Science  
Nakamura, Graph grammars with path-controlled embedding Balcazar, J.L., see R. Gavalda Baur, W., On the algebraic complexity of rational iteration procedures Bebjak, A. and I.  ...  Vazirani, Planar graph coloring is not self-reducible, Elsevier Science Publishers B.V. Shankar, P. and B.S.  ... 
doi:10.1016/0304-3975(91)90384-e fatcat:rv5vfp5crrfzzlwulp7uyorjcq

Embedded parser generators

Jonas Duregård, Patrik Jansson
2011 Proceedings of the 4th ACM symposium on Haskell - Haskell '11  
A simple extension to the grammar formalism adds anti-quoting, in turn allowing Haskell code embedded in the concrete syntax of the embedded languages.  ...  We merge this with the practice of embedding languages in Haskell, both by embedding BNFC itself and embedding all languages defined using BNFC-meta.  ...  Embedding the language definitions also allow users to define their own functions in the same module as the parser. The fact that grammars are embedded in the target language (i.e.  ... 
doi:10.1145/2034675.2034689 dblp:conf/haskell/DuregardJ11 fatcat:cfyn7dcfnjbitirz3ofmik22lu
« Previous Showing results 1 — 15 out of 18,520 results