SLR(K) COVERING FOR LR(K) GRAMMARS
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | LEE, MJ | ko |
| dc.contributor.author | Choe, Kwang-Moo | ko |
| dc.date.accessioned | 2013-02-25T16:54:48Z | - |
| dc.date.available | 2013-02-25T16:54:48Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 1991-03 | - |
| dc.identifier.citation | INFORMATION PROCESSING LETTERS, v.37, no.6, pp.337 - 347 | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/63706 | - |
| dc.description.abstract | We show that every LR(k) context-free grammar can be right covered by an SLR(k) grammar. We give a method of transforming an arbitrary LR(k) grammar into an SLR(k) grammar which right covers it. The transformation is based on the LR(k) parser for the given grammar. | - |
| dc.language | English | - |
| dc.publisher | ELSEVIER SCIENCE BV | - |
| dc.title | SLR(K) COVERING FOR LR(K) GRAMMARS | - |
| dc.type | Article | - |
| dc.identifier.wosid | A1991FH19900008 | - |
| dc.identifier.scopusid | 2-s2.0-0026121357 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 37 | - |
| dc.citation.issue | 6 | - |
| dc.citation.beginningpage | 337 | - |
| dc.citation.endingpage | 347 | - |
| dc.citation.publicationname | INFORMATION PROCESSING LETTERS | - |
| dc.identifier.doi | 10.1016/0020-0190(91)90152-8 | - |
| dc.contributor.localauthor | Choe, Kwang-Moo | - |
| dc.contributor.nonIdAuthor | LEE, MJ | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | FORMAL LANGUAGES | - |
| dc.subject.keywordAuthor | GRAMMAR COVERING | - |
| dc.subject.keywordAuthor | LR(K) GRAMMAR | - |
| dc.subject.keywordAuthor | SLR(K) GRAMMAR | - |
- Appears in Collection
- CS-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 4 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.