Abstract
An Early's parsing algorithm was shown to be an abstract interpretation of a refinement of the derivation semantics of context-free grammars. A compile-time/static analysis of the grammar was used for top-down left-to-right generation of sets of grammar items abstracted. It was found that the preliminary static grammar analysis was used to ensure that the bottom-up recognition with left context was deterministic.
Original language | English (US) |
---|---|
Pages (from-to) | 531-544 |
Number of pages | 14 |
Journal | Theoretical Computer Science |
Volume | 290 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1 2003 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science