WEKO3
アイテム
Some Properties of an Algorithm for Constructing LL(1) Parsing-Tables Using Production Indices
https://ipsj.ixsq.nii.ac.jp/records/59792
https://ipsj.ixsq.nii.ac.jp/records/5979257e198e4-4574-47c9-96f9-8558b765baa9
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP1104002.pdf (538.3 kB)
|
Copyright (c) 1989 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1989-03-08 | |||||||
| タイトル | ||||||||
| タイトル | Some Properties of an Algorithm for Constructing LL(1) Parsing-Tables Using Production Indices | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Some Properties of an Algorithm for Constructing LL(1) Parsing-Tables Using Production Indices | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| College of Engineering Shizuoka University | ||||||||
| 著者所属 | ||||||||
| Hamamatsu Polytechnic College | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| College of Engineering, Shizuoka University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Hamamatsu Polytechnic College | ||||||||
| 著者名 |
Keiichi, Yoshida
× Keiichi, Yoshida
|
|||||||
| 著者名(英) |
Keiichi, Yoshida
× Keiichi, Yoshida
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper reveals five valuable properties of Algorithm H discussed in the paper [2]. Algorithm H can construct parsing-tables for LL(1) grammars only by table-handling using the indices given to the productions of the grammars without set-calculations which are needed by conventional methods. Furthermore based on the property revealed in this paper it has been shown that Algorithm H can be revised into an algorithm to point out the non-LL(1)ness of input grammars. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper reveals five valuable properties of Algorithm H discussed in the paper [2]. Algorithm H can construct parsing-tables for LL(1) grammars only by table-handling using the indices given to the productions of the grammars without set-calculations, which are needed by conventional methods. Furthermore, based on the property revealed in this paper, it has been shown that Algorithm H can be revised into an algorithm to point out the non-LL(1)ness of input grammars. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 11, 号 4, p. 258-262, 発行日 1989-03-08 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
