| タイトル | An algorithm for generating abstract syntax trees |
| 本文（外部サイト） | http://hdl.handle.net/2060/19850013693 |
| 著者（英） | Noonan, R. E. |
| 著者所属（英） | NASA Langley Research Center |
| 発行日 | 1985-01-01 |
| 言語 | eng |
| 内容記述 | The notion of an abstract syntax is discussed. An algorithm is presented for automatically deriving an abstract syntax directly from a BNF grammar. The implementation of this algorithm and its application to the grammar for Modula are discussed. |
| NASA分類 | COMPUTER PROGRAMMING AND SOFTWARE |
| レポートNO | 85N22003
ICASE-85-4
NAS 1.26:172541
NASA-CR-172541 |
| 権利 | No Copyright |
| URI | https://repository.exst.jaxa.jp/dspace/handle/a-is/156862 |
