
AbstractThe original test for the LR-regular property is not quite correct. Generalizing the item method which is well known from LR(k) theory a decidable criterion and a parsing algorithm are obtained. The method can be applied to LL-regular and LC-regular parsing too. It yields tests and inclusion theorems for the various classes of grammars considered.
Computational Theory and Mathematics, Computer Networks and Communications, Applied Mathematics, parsing algorithm, inclusion theorems for grammars, Theory of compilers and interpreters, decidable criterion, Theoretical Computer Science
Computational Theory and Mathematics, Computer Networks and Communications, Applied Mathematics, parsing algorithm, inclusion theorems for grammars, Theory of compilers and interpreters, decidable criterion, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
