| Popis: |
The two best known parsing algorithms are LR and LL parsing respectively. These algorithms are explained extensively in the vast literature on compiler construction and formal language theory. In almost any textbook, LR and LL are regarded as two distinct methods. In this paper we will show that there exists a clear relationship between those methods, putting them into one framework. To our experience, such a framework is very useful from a didactic point of view. Moreover, the relationship between LR and LL provides a deeper insight into each separate method. |
