全文获取类型
收费全文 | 86篇 |
免费 | 14篇 |
国内免费 | 11篇 |
学科分类
工业技术 | 111篇 |
出版年
2021年 | 1篇 |
2020年 | 1篇 |
2017年 | 2篇 |
2015年 | 4篇 |
2014年 | 1篇 |
2013年 | 5篇 |
2012年 | 9篇 |
2011年 | 7篇 |
2010年 | 3篇 |
2009年 | 1篇 |
2008年 | 7篇 |
2007年 | 5篇 |
2006年 | 4篇 |
2005年 | 6篇 |
2004年 | 5篇 |
2003年 | 4篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1995年 | 2篇 |
1994年 | 2篇 |
1992年 | 1篇 |
1987年 | 1篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有111条查询结果,搜索用时 609 毫秒
1.
《国际计算机数学杂志》2012,89(2):107-119
The paper is the second in a series of three papers devoted to a detailed study of LR(k) parsing with error recovery and correction. Error recovery in LR(k) parsing of a context-free grammar is formalized by extending an LR(k) parser of the grammar such that it accepts all strings over the terminal vocabulary. The parse produced by this extension for a terminal string is a right parse if the string is in the language. In the case of a string not in the language the parse produced by the extension contains so-called error productions which represent the error recovery actions performed by the extension. The treatment is based on the formalization of LR(k) parsing presented in the first paper in the series and it covers practically all error recovery methods designed for LR(k) parsing. 相似文献
2.
3.
In principle, the version space approach can be applied to any induction problem. However, in some cases the representation language for generalizations is so powerful that (1) some of the update functions for the version space are not effectively computable, and (2) the version space contains infinitely many generalizations. The class of context-free grammars is a simple representation that exhibits these problems. This paper presents an algorithm that solves both problems for this domain. Given a sequence of strings, the algorithm incrementally constructs a data structure that has nearly all the beneficial properties of a version space. The algorithm is fast enough to solve small induction problems completely, and it serves as a framework for biases that permit the solution of larger problems heuristically. The same basic approach may be applied to representations that include context-free grammars as special cases, such as And-Or graphs, production systems, and Horn clauses. 相似文献
4.
Abstract We consider grammar systems in which several components are active at the same moment (a team of components is working). The power of such mechanisms is investigated and it is found that in many cases the team feature increases the generative capacity of grammar systems. In the so-called t-mode of derivation (a team works as much as it can) it is found that the team size does not induce an infinite hierarchy of languages. However, the family obtained in this case is a full abstract family of languages properly including ETOL. 相似文献
5.
本文将模糊树自动机和模糊上下文无关树文法的概念推广到格半群上。证明了在接受语言和生成语言的意义下,树自动机和上下文无关树文法是等价的。同时给出了构造正规形式的等价文法的方法。 相似文献
6.
Summary A new method for transforming grammars into equivalent LL(k) grammars is studied. The applicability of the transformation is characterized by defining a subclass of LR(k) grammars, called predictive LR(k) grammars, with the property that a grammar is predictive LR(k) if and only if the corresponding transformed grammar is LL(k). Furthermore, it is shown that deterministic bottom-up parsing of a predictive LR(k) grammar can be done by the LL(k) parser of the transformed grammar. This parsing method is possible since the transformed grammar always left-to-right covers the original grammar. The class of predictive LR(k) grammars strictly includes the class of LC(k) grammars (the grammars that can be parsed deterministically in the left-corner manner). Thus our transformation is more powerful than the one previously available, which transforms LC(k) grammars into LL(k) form. 相似文献
7.
针对如何在计算机中生成和显示方块苗文的问题,提出了一种方块苗文动态构造方法,给出了该方法的基本原理,定义了实现方块苗文动态构造所需要的操作符,并以谓词规则的形式对方块苗文动态构造变换操作进行了描述。该方法仅需存储方块苗文构件及独体字的显现字符,通过对显现字符进行上下组合、左右组合、侧围组合来实现方块苗文的动态构造,为方块苗文字库中字形构件提取及合体字自动生成技术提供了重要支持。 相似文献
8.
Augusto Celentano 《Computer Languages, Systems and Structures》1981,6(2):95-107
Extended context-free grammars allow regular expressions to appear in productions right hand sides, and are a clear and natural way to describe the syntax of programming languages.In this paper an LR parsing technique for extended context-free grammars is presented, which is based on an underlying transformation of the grammar into an equivalent context-free one.The technique is suitable for inclusion in one-pass compilers: the implementation requires little extensions to the algorithms working for normal LR grammars. Besides describing the parsing method, the paper shows also the algorithms for deriving the parsing tables; tables optimization is also discussed. Finally, this technique is compared with other proposals appeared in the literature. 相似文献
9.
10.