Premium
Even faster lr parsing
Author(s) -
Horspool R. Nigel,
Whitney Michael
Publication year - 1990
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380200602
Subject(s) - parsing , computer science , executable , lr parser , parser combinator , programming language , top down parsing , table (database) , code (set theory) , artificial intelligence , set (abstract data type) , data mining
Conventional LR parser generators create tables which are used to drive a standard parser procedure. Much faster parsers can be obtained by compiling the table entries into code that is directly executed. A possible drawback with a directly executable parser is its large size. In this paper, we introduce optimization techniques that increase the parsing speed even further while simultaneously reducing the size of the parser.