| 摘要 |
<p>A method for compressing an LR (Left-Right), LALR, or SLR parsing table into a compact and time-efficient representation which is machine and language independent, and allows access to table entries with a constant number of primitive operations. The primitive operations used: addition, comparison, and vector indexing, are in general very efficiently implemented on most machines, and are the key to the superior time performance of this method over other methods. Transformations are applied to the parsing table prior to compression that makes the method of the present invention competitive and very often superior to other space-efficient methods.</p> |
