全文获取类型
收费全文 | 79篇 |
免费 | 1篇 |
国内免费 | 1篇 |
专业分类
无线电 | 1篇 |
自动化技术 | 80篇 |
出版年
2020年 | 1篇 |
2018年 | 1篇 |
2015年 | 2篇 |
2014年 | 1篇 |
2013年 | 1篇 |
2012年 | 4篇 |
2011年 | 2篇 |
2010年 | 1篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2006年 | 1篇 |
2005年 | 2篇 |
2003年 | 1篇 |
2002年 | 2篇 |
1997年 | 1篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1972年 | 2篇 |
排序方式: 共有81条查询结果,搜索用时 15 毫秒
1.
C. Pronk 《Software》1992,22(10):885-897
During standardization discussions on Modula-2 the question was raised whether the future standard should need a clause stating a set of minimal requirements for conforming implementations regarding the ‘structuredness’ of lexical, syntactical and run-time constructs in programs written in this language. It was decided to test a number of compilers to find their actual limits on the structuredness of some of these constructs. The test results do not only show these limits, but the inability of some compilers to handle large and complex inputs is shown as well. 相似文献
2.
Frank G. Pagan 《Software》1988,18(6):509-527
There is an effective and quite general method of manually deriving compilers from programming-language interpreters without dealing directly with machine language. The method is an implementation of the largely theoretical and under-appreciated concept of partial computation, but can be understood on its own terms. It involves the translation of a source program's intermediate form into the interpreter's implementation language. This paper shows how the method can be used to transform both a sample iterative interpreter and a sample recursive interpreter into compilers. The result can be a large gain in program execution speed. Other advantages of the method, including the ease and practicality of applying it, are discussed. 相似文献
3.
Jun Cao Ayush Goyal Krista A. Novstrup Samuel P. Midkiff James M. Caruthers 《International journal of parallel programming》2009,37(2):127-152
Well designed domain specific languages have three important benefits: (1) the easy expression of problems, (2) the application
of domain specific optimizations (including parallelization), and (3) dramatic improvements in productivity for their users.
In this paper we describe a compiler and parallel runtime system for modeling the complex kinetics of rubber vulcanization
and olefin polymerization that achieves all of these goals. The compiler allows the development of a system of ordinary differential
equations describing a complex vulcanization reaction or single-site olefin polymerization reaction—a task that used to require
months—to be done in hours. A specialized common sub-expression elimination and other algebraic optimizations sufficiently
simplify the complex machine generated code to allow it to be compiled—eliminating all but 8.0% of the operations in our largest
program and enabling over 60 times faster execution on our largest benchmark codes. The parallel runtime and dynamic load
balancing scheme enables fast simulations of the model. 相似文献
4.
Victor Schneider 《Software》1989,19(11):1111-1113
This is a technical note that assumes reader familiarity with Pagan's paper on converting scaled down Pascal p-code programming language interpreters into simple compilers.1 This note discusses the extension of Pagan's methods to a full-scale Pascal-to-C translator. In order to make procedure calls and typed function calls work properly for such a translator, it was found necessary to add type information to one of the p-code calling instructions (and alter the Pascal-to-p-code translator accordingly). A table of execution times for Pagan's ‘50 primes’ bench-mark program shows the improvements obtained as a result of successive refinements in the Pascal-to-C translator, until the present version that uses C ‘register variables’ for integer arithmetic.2 Programs compiled using this system can also be linked into C programs as functions or procedures and can be debugged using standard C debuggers. 相似文献
5.
《国际计算机数学杂志》2012,89(1-4):141-148
A language for specifying lexical scans is described.The language uses the model of a finite state automation with a limited back-up facility.It is efficiently implementable and is machine independent except for one statement which depends on the machine's character set. 相似文献
6.
Schmeiser and Barnard described a method for producing the left parse at the end of the bottom-up parsing process. We improve their method in the sense that the left parse is actually produced during the bottom-up parsing process (i.e., with considerably less delay). 相似文献
7.
8.
James R. Larus 《Software》1990,20(12):1241-1258
Many areas of computer performance analysis require detailed traces of events that occur during a program's execution. Collecting traces is expensive. The additional code required to record events greatly slows a program's execution. In addition, the resulting trace files can grow unmanageably large. This paper describes a technique called abstract execution that alleviates both problems. Abstract execution records a small set of events during the traced program's execution. These events serve as input to an abstract version of the program that generates a full trace by re-executing selected portions of the original program. This process greatly reduces both the cost of tracing the original program and the size of the trace files. The cost of regenerating a trace is insignificant in comparison to the cost of applications that use it. This paper also describes a system called AE that implements Abstract Execution. The paper contains measurements that demonstrate that AE can efficiently trace large programs. 相似文献
9.
Conventional LR parser generators create tables which are used to drive a standard parser procedure. Much faster parsers can be obtained by compiling the table entries into code that is directly executed. A possible drawback with a directly executable parser is its large size. In this paper, we introduce optimization techniques that increase the parsing speed even further while simultaneously reducing the size of the parser. 相似文献
10.
R. Nigel Horspool 《Computer Languages, Systems and Structures》1990,15(4):205-223
Implementation of a new compiler usually requires making frequent adjustments to grammar definitions. An incremental technique for updating the parser tables after a monor change to the grammer could potentially save much computational effort. More importantly, debugging a grammar is made easier if the grammar is re-checked for correctness after each small change to the grammar. The basic design philosophy of an incremental parser generator, and incremental algorithms for LR(0), SLR(1) and LALR(1) parser generation are discussed in this paper. Some of these algorithms have been incorporated into an implementation of an incremental LALR(1) parser generator. 相似文献