TY  - JOUR
T1  - On Equi-LR automata
AU  - Lee, Gyung-Ok 
JO  - Journal of KIISE, JOK
PY  - 2021
DA  - 2021/1/14
DO  - 10.5626/JOK.2021.48.3.352
KW  - LR automata
KW  - complexity of LR automata
KW  - LR parsers
KW  - parsing
KW  - compiler
AB  - LR parsing is a representative bottom-up parsing method, and LR automata have been used as the essential frame for the construction of LR parser. This paper defines an equivalence class of classical LR items, which is called Equi-LR class and defines Equi-LR automata by using Equi-LR class instead of classical LR items. This paper shows that Equi-LR automata have the advantage of reduced construction time over classical LR automata, and the size complexity of LR parser in the frame of Equi-LR automata is tighter compared with the frame of classical LR automata.