Add to ORKGA new method of specifying the syntax of programming languages, known as hierarchical language specifications (HLS), is proposed. Efficient parallel algorithms for parsing languages generated by HLS are presented. These algorithms run on an exclusive-read exclusive-write parallel random-access machine. They require O(n) processors and O(log2n) time, where n is the length of the string to be parsed. The most important feature of these algorithms is that they do not use a stack
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algori...
ATLANTIS is a tool for the semi-automatic generation of interpretive language implementations from f...
The paper presents an efficiently parallel parsing algorithm for arbitrary contextfree grammars. Thi...
A new method of specifying the syntax of programming languages, known as hierarchical language speci...
A parallel parsing technique is presented in which parentheses are inserted in the string to be pars...
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorith...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
A parallel algorithm that requires O(log(n)) time on O(n) processors on a CREW PRAM, is presented fo...
AbstractLet T(n) be the time to recognize context-free languages on a parallel random-access machine...
A general framework for parallel parsing is presented, which allows for a unitied, systematic approa...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
Non-canonical generalization of several bottom-up parsing methods, including Simple Precedence, LR(...
A new parallel parsing algorithm for block structured languages, capable of parsing incremen- tally ...
This topic of this thesis is parallel parsing using context-free grammars and attribute grammars. Th...
Specification and analysis of the sequencing of computing operations in high level languages : with ...
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algori...
ATLANTIS is a tool for the semi-automatic generation of interpretive language implementations from f...
The paper presents an efficiently parallel parsing algorithm for arbitrary contextfree grammars. Thi...
A new method of specifying the syntax of programming languages, known as hierarchical language speci...
A parallel parsing technique is presented in which parentheses are inserted in the string to be pars...
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorith...
The Bird-Meertens theory of lists and two theorems by Bird are used to develop associative operators...
A parallel algorithm that requires O(log(n)) time on O(n) processors on a CREW PRAM, is presented fo...
AbstractLet T(n) be the time to recognize context-free languages on a parallel random-access machine...
A general framework for parallel parsing is presented, which allows for a unitied, systematic approa...
The success of parallel architectures has been limited by the lack of high-level parallel programmin...
Non-canonical generalization of several bottom-up parsing methods, including Simple Precedence, LR(...
A new parallel parsing algorithm for block structured languages, capable of parsing incremen- tally ...
This topic of this thesis is parallel parsing using context-free grammars and attribute grammars. Th...
Specification and analysis of the sequencing of computing operations in high level languages : with ...
We present a divide-and-conquer algorithm for parsing context-free languages efficiently. Our algori...
ATLANTIS is a tool for the semi-automatic generation of interpretive language implementations from f...
The paper presents an efficiently parallel parsing algorithm for arbitrary contextfree grammars. Thi...