Abstract:
The use of precedence functions rather than precedence relations in defining the boundaries of convoluted segments of the input texts increases of the efficiency of the parallel syntactical analysis of algorithm.
The notion of the precedence functions is introduced for a conflictless grammar with four precedence relations. The necessary and sufficient conditions for their existence are introduced. The existence theorem is proved.
Fulltext:
PDF file (763 kB)