Abstract
| Original language | English |
|---|---|
| Title of host publication | Automata, Languages and Programming, Fifth Colloquium |
| Editors | G. Ausiello, C. Bohm |
| Place of Publication | Berlin |
| Publisher | Springer |
| Pages | 330-344 |
| Number of pages | 15 |
| ISBN (Print) | 978-3-540-08860-8 |
| DOIs | |
| Publication status | Published - Jul 1978 |
| Event | Fifth Colloquium on Automata, Languages and Programming 1978 - Udine, Italy Duration: 17 Jul 1978 → 21 Jul 1978 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Verlag |
| Volume | 62 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | Fifth Colloquium on Automata, Languages and Programming 1978 |
|---|---|
| Country | Italy |
| City | Udine |
| Period | 17/07/78 → 21/07/78 |
Fingerprint
Keywords
- HMI-SLT: Speech and Language Technology
Cite this
}
On the parsing and covering of simple chain grammars. / Nijholt, Anton.
Automata, Languages and Programming, Fifth Colloquium. ed. / G. Ausiello; C. Bohm. Berlin : Springer, 1978. p. 330-344 10.1007/3-540-08860-1_24 (Lecture Notes in Computer Science; Vol. 62).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review
TY - CHAP
T1 - On the parsing and covering of simple chain grammars
AU - Nijholt, Anton
PY - 1978/7
Y1 - 1978/7
N2 - A method is presented for obtaining a simple deterministic pushdown transducer which acts as a parser for simple chain grammars. It is shown that a simple deterministic grammar can be constructed which covers the simple chain grammar. To obtain both the simple deterministic pushdown transducer and the cover result, a new type of parse is introduced which differs from the left and right parses which are common for the usual one pass no back-tracking parsing algorithms. For the simple chain grammars this parse, the so-called left part parse, follows from a simple left part property which is satisfied by the grammatical trees of simple chain grammars.
AB - A method is presented for obtaining a simple deterministic pushdown transducer which acts as a parser for simple chain grammars. It is shown that a simple deterministic grammar can be constructed which covers the simple chain grammar. To obtain both the simple deterministic pushdown transducer and the cover result, a new type of parse is introduced which differs from the left and right parses which are common for the usual one pass no back-tracking parsing algorithms. For the simple chain grammars this parse, the so-called left part parse, follows from a simple left part property which is satisfied by the grammatical trees of simple chain grammars.
KW - HMI-SLT: Speech and Language Technology
U2 - 10.1007/3-540-08860-1_24
DO - 10.1007/3-540-08860-1_24
M3 - Chapter
SN - 978-3-540-08860-8
T3 - Lecture Notes in Computer Science
SP - 330
EP - 344
BT - Automata, Languages and Programming, Fifth Colloquium
A2 - Ausiello, G.
A2 - Bohm, C.
PB - Springer
CY - Berlin
ER -