| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 10
reviews
|
|
|
 |
|
|
|
|
Guide to RISC processors: for programmers and engineers
Dandamudi S., Springer-Verlag New York, Inc., Secaucus, NJ, 2005. 387 pp. Type: Book (9780387210179)
An elementary introduction to reduced instruction set computing (RISC) processors, with an overall emphasis on the machine-level language and not on functional chip design, is presented in this book. It is split into three sections: a ...
|
Sep 22 2005 |
|
|
|
|
|
|
Expert C# business objects
Lhotka R., APress, LP, 2004. Type: Book (9781590593448)
Using the Microsoft C# language to create a framework of business objects in the Microsoft .NET environment is covered in this book. These objects encapsulate a number of features applicable in a distributed architecture. The framework...
|
Nov 11 2004 |
|
|
|
|
|
|
Quantum complexity theory
Bernstein E., Vazirani U. SIAM Journal on Computing 26(5): 1411-1473, 1997. Type: Article
The authors define a quantum Turing machine (QTM) analogously to the classic Turing machine as a triplet ( &Sgr; , Q , &dgr; ), where &Sgr; is a finite alphabet with an identified blank symbol #,
|
Mar 1 1999 |
|
|
|
|
|
|
System software programming
Clarke D., Merusi D., Prentice Hall Press, Upper Saddle River, NJ, 1998. Type: Book (9780134905587)
This introduction to compilers, concurrency, and synchronization uses examples taken from Unix and the Win32 application programming interface (API). The first three chapters introduce basic machine architecture, assemblers, linking, a...
|
Jul 1 1998 |
|
|
|
|
|
|
Basic notions of universal algebra for language theory and graph grammars
Courcelle B. Theoretical Computer Science 163(1-2): 1-54, 1996. Type: Article
Courcelle reviews generalizations of context-free and regular languages in terms of equational and recognizable subsets of universal algebras, which consolidate classical concepts of context-free and regular languages with tree automat...
|
Apr 1 1998 |
|
|
|
|
|
|
Practice and principles of compiler building with C
Alblas H., Nymeyer A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1996. Type: Book (9780133492675)
The first part of this book is an introduction to compilers using C program procedures to illustrate a recursive descent parser for a simple language called SLANG, and the second is an introduction to the principles underlying compiler...
|
Jul 1 1997 |
|
|
|
|
|
|
Parallel parsing on a one-way array of finite-state machines
Chang J., Ibarra O., Palis M. IEEE Transactions on Computers 36(1): 64-75, 1987. Type: Article
This research gives a proof that a string of length n from a context-free language can be both recognized and parsed by one-way two-dimensional iterative arrays (2-DIAs) of size n2 of finite-state machines....
|
Aug 1 1988 |
|
|
|
|
|
|
Breaking the code
Whitemore H., 2000. Type: Book (9780121070700)
Breaking the Code is a play about the life of Alan Turing, written by Hugh Whitemore and directed by Clifford Williams. It is currently playing in the Neil Simon Theatre in New York....
|
Apr 1 1988 |
|
|
|
|
|
|
Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages
Ayers K. Theoretical Computer Science 40(2-3): 163-174, 1985. Type: Article
The author defines the concept of &lgr;-linearly bounded deque automata (&lgr;-LBDA). A deque automaton is defined to be a pushdown automaton in which stack symbols may be pushed onto both the top and bottom of the stack but ma...
|
Jun 1 1987 |
|
|
|
|
|
|
Compact recursive-descent parsing of expressions
Hanson D. (ed) Software--Practice & Experience 15(12): 1205-1212, 1985. Type: Article
Although most new full compilers are written using compiler generators, compilers for small languages and for command line interpreters may be constructed by hand, usually with recursive descent parsers. Typically, since such parsers i...
|
Oct 1 1986 |
|
|
|
|
|
| |
|
|
| |
|
|
