Abstract
The authors are interested in generating practical Prolog programs automatically from their specifications in attribute grammars in (AGs). They introduce a prototype system to perform this generation. Common attributes are introduced to overcome some disadvantages of Ags. Common attributes provide a solution to the copy-rule problem, reducing copy rules from 50-70% to 10%. A specification language named PANDA has been developed on the basis of the extended AG. A Prolog generator has been constructed that generates Prolog programs from PANDA programs. The generator tests whether a given grammar is an L-attribute grammar with a necessary sufficient condition proposed by the authors, and includes some optimization strategies to generate faster-running Prolog programs.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - IEEE Computer Society's International Computer Software & Applications Conference |
| Publisher | IEEE |
| Pages | 605-612 |
| Number of pages | 8 |
| ISBN (Print) | 0818608064 |
| Publication status | Published - 1987 |
| Externally published | Yes |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
Cite this
GENERATING PRACTICAL PROLOG PROGRAMS FROM ATTRIBUTE GRAMMARS. / Feng, An; Sugiyama, Yuji; Fujii, Mamoru; Torii, Koji.
Proceedings - IEEE Computer Society's International Computer Software & Applications Conference. IEEE, 1987. p. 605-612.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - GENERATING PRACTICAL PROLOG PROGRAMS FROM ATTRIBUTE GRAMMARS.
AU - Feng, An
AU - Sugiyama, Yuji
AU - Fujii, Mamoru
AU - Torii, Koji
PY - 1987
Y1 - 1987
N2 - The authors are interested in generating practical Prolog programs automatically from their specifications in attribute grammars in (AGs). They introduce a prototype system to perform this generation. Common attributes are introduced to overcome some disadvantages of Ags. Common attributes provide a solution to the copy-rule problem, reducing copy rules from 50-70% to 10%. A specification language named PANDA has been developed on the basis of the extended AG. A Prolog generator has been constructed that generates Prolog programs from PANDA programs. The generator tests whether a given grammar is an L-attribute grammar with a necessary sufficient condition proposed by the authors, and includes some optimization strategies to generate faster-running Prolog programs.
AB - The authors are interested in generating practical Prolog programs automatically from their specifications in attribute grammars in (AGs). They introduce a prototype system to perform this generation. Common attributes are introduced to overcome some disadvantages of Ags. Common attributes provide a solution to the copy-rule problem, reducing copy rules from 50-70% to 10%. A specification language named PANDA has been developed on the basis of the extended AG. A Prolog generator has been constructed that generates Prolog programs from PANDA programs. The generator tests whether a given grammar is an L-attribute grammar with a necessary sufficient condition proposed by the authors, and includes some optimization strategies to generate faster-running Prolog programs.
UR - http://www.scopus.com/inward/record.url?scp=0023537083&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0023537083&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0023537083
SN - 0818608064
SP - 605
EP - 612
BT - Proceedings - IEEE Computer Society's International Computer Software & Applications Conference
PB - IEEE
ER -