|
| Â Â |
| Â | Stack Computers: 3.2 A GENERIC STACK MACHINE |
 | | Stack Overflow/Underflow is by far the most frequent exceptional condition on a stack machine, so it will be used as an example for how "large grain" interrupts are handled. | | | Stack Overflow/Underflow occurs when the hardware stack memory capacity is exceeded by the application program. | | | With a stack machine, the instruction format is extremely simple (just an opcode) and the usual combinatorial explosion of operand/type combinations is completely absent. |
|
http://www.ece.cmu.edu/~koopman/stack_computers/sec3_2.html
|
|
| Â Â |
| Â | Encyclopedia4U - University of Utah - Encyclopedia Article |
| | The school has pioneered work in asynchronous circuits, computer animation, computer art, digital music recording, graphical user interfaces, and stack machine architectures. | | | Other accomplishments include the first method for representing surface textures in graphical images, the Gouraud smooth shading model for computer graphics, invention of magnetic ink printing technology, the Johnson counter logic circuit, development of the oldest algebraic mathematics package (REDUCE) still in use, and the Phong lighting model for shading with highlights. |
|
http://www.encyclopedia4u.com/u/university-of-utah.html
|
|
| Â Â |
| Â | Stack Computers: Appendix A -- A Survey of Computers with Hardware Stack Support |
| | Stack instructions were used because they led to easy code generation, compact programs, and easily pipelined hardware. | | | Stack instructions were also chosen to direct support high order languages to enhance software reliability. | | | Stack Computers: Appendix A -- A Survey of Computers with Hardware Stack Support |
|
http://www.ece.cmu.edu/~koopman/stack_computers/appa.html
|
|
| Â Â |
| Â | Stack, Heap and Frame Stack |
| | However, if a computation involves long strings, lists or too deep function called, the machine may not have the chance to free the memory and thus causes the ``heap overflow'' error. | | | The pseduo machine instruction, freeheap, releases all the memory allocated by previous computation. | | | A stack holds the values used and computed during evaluation of an EDEN program. |
|
http://www.dcs.warwick.ac.uk/research/modelling/other/eden/advanced/notes/stack.html
|
|
| Â Â |
| Â | Stack Computers: 9.5 TWO IDEAS FOR STACK MACHINE DESIGN |
| | Stack Computers: 9.5 TWO IDEAS FOR STACK MACHINE DESIGN | | | One of the design details is an observation by Doran (1972) that stack machines do not need conditional branches, they only need conditional subroutine return instructions. | | | Consider an IF statement in a high level language. |
|
http://www.ece.cmu.edu/~koopman/stack_computers/sec9_5.html
|
|
| Â Â |
| Â | 4. Example 1: A stack machine |
| | The stack machine reads one entry of the list at a time from the input file. | | | Q: Since the stack machine deals with only one list and has only one stack, I do not understand why you need the universes List and Stack. | | | We can manage without the universes List and Stack by implementing the input and the stack as arrays, but this would be a lower level of abstraction. |
|
http://www.eecs.umich.edu/gasm/tutorial/sectionstar3_5.html
|
|
| Â Â |
| Â | A queue machine for evaluating expressions |
| | Even if the queue machine turns out to be less memory efficient than the conventional stack machine, it may be that some of its features do make it attractive for some purposes. | | | For postfix it is always possible to restrict the search to the right, this is used in the stack machine below. | | | This is contrasted with using in-place rewriting of expressions and with using a stack machine. |
|
http://www.latrobe.edu.au/philosophy/phimvt/misc/queue.html
|
|
| Â Â |
| Â | SQLite Virtual Machine Opcodes |
| | Instead, the instructions of the program will be returned like a query result. | | | The only way for the virtual machine to interact with a database file is through a cursor. | | | The program is generated for a "virtual machine" implemented by the SQLite library. |
|
http://www.hwaci.com/sw/sqlite/opcode.html
|
|
| Â Â |
| Â | The lean, mean, virtual machine |
| | Thanks to the JVM, programs written in Java don't have to be rewritten to run on different computers. | | | An introduction to the basic structure and functionality of the Java Virtual Machine | | | The JVM executes Java bytecodes, so Java bytecodes can be thought of as the machine language of the JVM. |
|
http://www.javaworld.com/javaworld/jw-06-1996/jw-06-vm.html
|
|
| Â Â |
| Â | Squawks of the Parrot: Registers vs stacks for interpreter design |
| | Finally, some of the compile-time optimizations can be done at bytecode generation time for the register machine, where they have to be done at JIT time for the stack machine. | | | Anyway, as I also wrote in the mail, if you're designing an interpreter, a register machine makes sense for execution speed reasons (code generation for it is still an issue, though, as well as the compatibility issues that may arise with time with the call conventions). | | | JITting for a register-rich machine is, with a register-rich IL (Which one could consider a register based VM, the same way that a stack-based VM is a stack IL), is relatively easy, in part because a lot of the optimization decisions have been made, and in part because less information has been lost. |
|
http://www.sidhe.org/~dan/blog/archives/000189.html
|
|
| Â Â |
| Â | Chistory |
| | Until the early 1980s, although compilers existed for a variety of machine architectures and operating systems, the language was almost exclusively associated with Unix; more recently, its use has spread much more widely, and today it is among the languages most commonly used throughout the computer industry. | | | They are `close to the machine' in that the abstractions they introduce are readily grounded in the concrete data types and operations supplied by conventional computers, and they rely on library routines for input-output and other interactions with an operating system. | | | During the 1980s the use of the C language spread widely, and compilers became available on nearly every machine architecture and operating system; in particular it became popular as a programming tool for personal computers, both for manufacturers of commercial software for these machines, and for end-users interesting in programming. |
|
http://www.cs.bell-labs.com/~dmr/chist.html
|
|
| Â Â |
| Â | VM Spec Structure of the Java Virtual Machine |
| | Subcomputations may be nested on the operand stack, resulting in values that can be used by the encompassing computation. | | | A small number of Java Virtual Machine instructions (the dup instructions and swap) operate on run-time data areas as raw values of a given width without regard to type; these instructions must not be used to break up or rearrange the words of 64-bit data. | | | The memory space for these structures can be allocated simultaneously, since the sizes of the local variable area and operand stack are known at compile time and the size of the frame data structure depends only upon the implementation of the Java Virtual Machine. |
|
http://java.sun.com/docs/books/vmspec/html/Overview.doc.html
|
|
| Â Â |
| Â | Ea-Em |
| | The E mbeddable L inux K ernel S ubset is a project to create a version of Linux for 8086 to 80286 PCs, palmtop computers, single board microcomputers, embedded controller systems and other old computers. | | | queues, stacks, AVL trees, etc.), string handling and minibuffer handling functions missing in standard Emacs, and routines for handling lists of cookies in a buffer. | | | A graphical sound file editor based on the ecasound library and the Qt GUI library. |
|
http://stommel.tamu.edu/~baum/linuxlist/linuxlist/node15.html
|
|
| Â Â |
| Â | Stack Machine |
| | The last two bytes taken as a 16-bit integer form an operand which is a literal value, or a variable offset from a base in the stack, or a S-code instruction location, or an operation number, or a special routine number, depending on the op-code. | | | is a stack machine organized to simplify the implementation of block structured languages. | | | The action of each instruction is described using a mixture of English language description and mathematical formalism. |
|
http://cs.wwc.edu/~aabyan/464/Book/StackMachine.html
|
|
| Â Â |
| Â | MuP21 Machine Forth Tutorial #1 |
| | Machine Forth is not Fortan problem: given X define Y to perform 10 X Fortran solution: \ after we define something like ': (DO) \ machine Forth DO LOOP primitive r> a! | | | They spend more on a software layer to trap stack overflow and underflow bugs. | | | They must also make the software more complex to deal with this hardware. |
|
http://www.ultratechnology.com/mfp21.htm
|
|
| Â Â |
| Â | Specifying Types by Grammars: A Polymorphic Static Type Checker Operating at a Stack Machine Level (ResearchIndex) |
| | Specifying Types by Grammars: A Polymorphic Static Type Checker Operating at a Stack Machine Level (ResearchIndex) | | | Specifying Types by Grammars: A Polymorphic Static Type Checker Operating at a Stack Machine Level | | | @techreport{ robin94specifying, author = "Popplestone, Robin", title = "{S}pecifying types by grammars: {A} polymorphic static type chcker operating at a stack machine level", number = "FP-94-01", year = "94", url = "citeseer.ist.psu.edu/73738.html" } |
|
http://citeseer.ist.psu.edu/73738.html
|
|
| Â Â |
| Â | [No title] |
| | The program counter is initialized to the location of the first instruction. | | | The machine repeatedly fetches the instruction at the address in the PC, increments the PC and executes the instruction and stops when the the halt instruction encountered. | | | To introduce the machine organization and programming of a stack machine. |
|
http://cs.wwc.edu/~aabyan/LABS/AR/StackMachine.html
|
|
| Â Â |
| Â | Class 23: Register-Machine Simulator |
| | message 'operations) the-ops) (else (error "Unknown request -- MACHINE" message)))) dispatch))) (define (start machine) (machine 'start)) (define (get-register-contents machine register-name) (get-contents (get-register machine register-name))) (define (set-register-contents! | | | pc (get-contents reg))))) (else (error "Bad GOTO instruction -- ASSEMBLE" inst))))) (define (goto-dest goto-instruction) (cadr goto-instruction)) (define (make-save inst machine stack pc) (let ((reg (get-register machine (stack-inst-reg-name inst)))) (lambda () (push stack (get-contents reg)) (advance-pc pc)))) (define (make-restore inst machine stack pc) (let ((reg (get-register machine (stack-inst-reg-name inst)))) (lambda () (set-contents! | | | (get-register machine register-name) value) 'done) (define (get-register machine reg-name) ((machine 'get-register) reg-name)) (define (assemble controller-text machine) (extract-labels controller-text (lambda (insts labels) (update-insts! |
|
http://cparrish.sewanee.edu/cs376/class23.html
|
|
| Â Â |
| Â | Hohensee's 3 Stack machine 0.3 |
| | The following code has to be *compiled* here, but where it gets called from and where it jumps to is what the labels are for, so we skip it for now with a goto. | | | The H3sm Virtual (Machine) Address Space may be addressed on int or byte ply. | | | Everything we need the real machine for should be in here. |
|
http://linux01.gwdg.de/~rhohen/H3sm.c
|
|
| Â Â |
| Â | Pushdown automaton |
| | The finite automaton in question is usually nondeterministic (resulting in a nondeterministic pushdown automaton or NPDA) since deterministic pushdown automata cannot recognize all context-free languages. | | | A linear bounded automaton is a device which is more powerful than a pushdown automaton but less so than a Turing machine. | | | A NPDA W can be defined as a 7-tuple: |
|
http://www.sciencedaily.com/encyclopedia/pushdown_automaton
|
|
| Â Â |
| Â | Fitness Center |
| | Cutting Edge hydraulic Leg Extension Machine Leg Curl Machine | | | Dream Body hydraulic Leg Extension Machine Leg Curl Machine | | | As Seen on TV: Clean Between Machine by Wellquest |
|
http://fitness.idg-usa.com/
|
|
| Â Â |
| Â | ic Huddersfield - Someone, somewhere could be monitoring you |
| | The best rule of thumb when using the internet is to be careful and take nothing for granted and stack your machine with firewalls and as much security as it will stand. | | | You may be alone at home with your screen, but someone, somewhere could be monitoring everything you do and every move you make. | | | The cybersex industry made more than $1 billion in 2002 and is expected to reach $5 to $ billion by 2007. |
|
http://ichuddersfield.icnetwork.co.uk/0100news/0330features/page.cfm?objectid=14363484&method=full
|
|
| Â Â |
| Â | PATLITE Signal Towers, Stack Lights, Machine Status Indicator, Indicating Lights, <b><font ... |
| | The next step in signaling technology with the LME machine status indicator. | | | Each LED uses a patented double reflection system to maximize the brilliance of the high intensity LED. | | | PATLITE Signal Towers, Stack Lights, Machine Status Indicator, Indicating Lights, Indicating Lights, Visusal Lighting Products, Normal and Incandescent Lights |
|
http://www.netmotion.com/htm_files/ot_patlite_lme.htm
|
|
| Â Â |
| Â | Sports - The Daily Journal - www.thedailyjournal.com |
| | "This is a bargain deal," said third-year school board member Dave McCarthy, who added that the district saved a lot of money by moving the school's equipment into the room instead of purchasing all new machines. | | | It's big enough to comfortably house nearly 20 benches, a universal stack weight machine, numerous barbells, a squat rack and 84 dumbbells -- all equipment the athletics department had acquired over the years. | | | The new facility is between one-third and one-half larger than the old one, Surace said. |
|
http://www.thedailyjournal.com/apps/pbcs.dll/article?AID=/20041119/SPORTS/411190334/1006/SPORTS
|
|
| Â Â |
|  | º·¤ÇÒÁ : Stack machine |
| | * 16 KB MEMORY : CODE + DATA - 12 KB, STACK - 4 KB * Load/Store Architecture | | | * Use stack memory-temporary memory, from ALU operator | | | LDI 3 ; Push 3 LDI 2 ; Push 2 ADD ; Pop ordered 2,3 and push the result 2+3 to stack again STD A ; Pop 5 (Result) to memory at A |
|
http://www.etteam.com/article/paper/stackmachine.html
|
|
|
