Abstract
A new characterization of LL(1) grammars that lends itself to testing for the LL(1) property is given. The characterization calls for the testing of intersections of FIRST sets for individual symbols rather than for right hand sides of productions.
Original language | English (US) |
---|---|
Pages (from-to) | 275-280 |
Number of pages | 6 |
Journal | BIT |
Volume | 16 |
Issue number | 3 |
DOIs | |
State | Published - Sep 1976 |
Keywords
- FIRST
- FOLLOW
- compilers
- top down parsers
ASJC Scopus subject areas
- Software
- Computer Networks and Communications
- Computational Mathematics
- Applied Mathematics