LR-parsing of extended context free grammars

1976 ◽  
Vol 7 (1) ◽  
pp. 61-73 ◽  
Author(s):  
O. L. Madsen ◽  
B. B. Kristensen
2006 ◽  
Vol 17 (03) ◽  
pp. 629-664 ◽  
Author(s):  
ALEXANDER OKHOTIN

The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical connectives added to the formalism of rules. In addition to the standard LR operations, Shift and Reduce, the new algorithm uses a third operation called Invalidate, which reverses a previously made reduction. This operation makes the mathematical justification of the algorithm significantly different from its prototype. On the other hand, the changes in the implementation are not very substantial, and the algorithm still works in time O(n4).


1975 ◽  
Vol 4 (53) ◽  
Author(s):  
Ole Lehrmann Madsen ◽  
Bent Bruun Kristensen

<p>A dynamically microprogrammable processor called MATHILDA is described.MATHILDA has been designed to be used as a tool in interpreter and processor design research. It has a very general microinstruction sequencing scheme, sophisticated masking and shifting capability, high speed local storage, a 64-bit wide main data path, a partially encoded microinstruction, and other features which make it reasonably well suited for this purpose. Also, hardware modification is relatively easily undertaken to enhance the experimental nature of the machine.</p><p>Revised version (first version 1975).</p>


Sign in / Sign up

Export Citation Format

Share Document