Please use this identifier to cite or link to this item:
doi:10.22028/D291-26139 | Title: | A graph based parsing algorithm for context-free languages |
| Author(s): | Hotz, Günter |
| Language: | English |
| Year of Publication: | 1999 |
| OPUS Source: | Saarbrücken, 1999 |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | We present a simple algorithm deciding the word problem of c. f. languages in O(n^{3}). It decides this problem in time O(n^{2}) for unambiguous grammars and in time O(n) in the case of LR(k) grammars. |
| Link to this record: | urn:nbn:de:bsz:291-scidok-42095 hdl:20.500.11880/26195 http://dx.doi.org/10.22028/D291-26139 |
| Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
| Series volume: | 1999/01 |
| Date of registration: | 7-Sep-2011 |
| Faculty: | MI - Fakultät für Mathematik und Informatik |
| Department: | MI - Informatik |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| fb14_1999_01.pdf | 301,75 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.