/pdf/proprietes-de-complexite-pour-une-famille-d-algorithmes-de-3kb46py6ts.pdf

Propriétés de complexité pour une famille d'algorithmes de Markov

A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language. Despite its computational power, it is meant to be used primarily for parsing programming and domain-specific languages. It enables a straightforward simulation of a number of existing parsing algorithms based on context-free grammars. The list includes both top-down shift-produce methods (such as SLL and LL) and bottom-up shift-reduce methods (such as LALR and LR), as well as mixed top-down-and-bottom-up methods such as LLLR. To justify the use of the new parsing method, the paper provides numerous examples of how a parser can actually be made in practice. It is advised that the main part of the parser is based on some simple well-established approach, e.g., SLL(1), while syntactically more complicated phrases can be parsed by exploiting the full power of the new parser. These phrases may either be extensions to the original language or some embedded domain-specific language. In all such and similar cases, no part of the language is restricted to be context-free. In fact, context-sensitive languages can be handled quite efficiently.

https://www.mdpi.com/2227-7390/11/7/1594/pdf?version=1680012955

On Parsing Programming Languages with Turing-Complete Parser

Markov algorithms have received very little attention in the studies about formal languages, so the purpose of the present paper is twofold: i) to characterize languages in terms of Markov algorithms, and ii) to produce automatically Markov algorithms accepting or parsing languages generated by given grammars.

Some relations between Markov algorithms and formal languages

In information retrieval systems storage occupancy is in general disregarded to take advantage in running time; in an environment in which retrieval time is not a primary requirement (this is the case of Data Base Machines), transposed files become a very interesting structure; in fact they allow a considerable space saving with respect to fast access structures, such as inverted files. But transposed files, in most cases, are not practicable, as theyare to be searched by a sequential scanning.

G. Leoni

Papers

Some relations between Markov algorithms and formal languages

Una struttura bidimensionale per la memorizzazione dei file trasposti