We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing algorithm working at complexity O(n 3) in the worst case, which is achieved by the use of dynamic programming to represent the non-deterministic evolution of the stack instead of graph-structured stack representations, as has...

Stack-based languages (e.g. Forth (Moore 1974), Postscript (Inc. 1999)) have been around for nearly four decades. They are particularly popular today for use as intermediate languages (e.g. CIL (ECMA 2002), JVML (Lindholm and Yellin 1999), (Morrisett et al. 1998)). This is for several reasons: they have good run-time performance characteristics, they resemble the machine level instructions on m...

Incremental stack-copying was used to implement OR-parallel Prolog efficiently in the MUSE system. The idea of incremental stack-copying is to only copy the difference between the WAM data areas of two processors, instead of copying them entirely. In order to further reduce the communication during stack-copying and make its implementation efficient on distributed memory machines, a new techniq...

We introduce and investigate input-driven stack automata, which are a generalization of input-driven pushdown automata that recently became popular under the name visibly pushdown automata. Basically, the idea is that the input letters uniquely determine the operations on the pushdown store. This can nicely be generalized to stack automata by further types of input letters which are responsible...

In the title molecule, C(9)H(3)Cl(3)O(3), there are three short interactions involving the benzene H atoms and the chloro-formyl Cl atoms. In the crystal, mol-ecules stack along the a axis with no significant non-bonded inter-actions.

In this research the simulation of an air independent Proton Exchange Membrane Fuel Cell (PEMFC) propulsion system was taken into consideration. The system consists of several parts including PEM fuel cell stack, metal hydride and liquid oxygen (LOX) tanks, and also pre-heaters of oxygen and hydrogen gases along with other heat exchangers, to ensure proper operation of system. The heat recovery...

The Gromov-Witten theory of Deligne-Mumford stacks is a recent development, and hardly any computations have been done beyond 3-point genus 0 invariants. This paper provides explicit recursions which, together with some invariants computed by hand, determine all genus 0 invariants of the stack PD,2 . Here D is a smooth plane curve and PD,2 is locally isomorphic to the stack quotient [U/(Z/(2))]...

SUMMARY This paper presents a method for comparing and detecting clones of Java programs by analyzing program stack flows. A stack flow denotes an operational behavior of a program by describing individual instructions and stack movements for performing specific operations. We analyze stack flows by simulating the operand stack movements during execution of a Java program. Two programs for dete...

Those of us who have worked with stack computers for several years have found an unending source of amazement-and some consternation-in how few computer professionals there are who seem aware that there is an entirely different approach to computer architecture from the familiar von Neumann model. Sometimes when such phrases as "zero-address machine" have dropped from my lips, and I see that th...

s of Invited Talks Object-Oriented Programming without InheritanceBjarne Stroustrup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Programming in the Large for the Internet of ThingsJong-Deok Choi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....