| Creator |
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| JaLC DOI |
|
| Related DOI |
|
|
|
|
|
|
|
| Related URI |
|
|
|
|
|
|
|
| Relation |
|
|
|
|
|
|
|
| Abstract |
The paper presents an efficiently parallel parsing algorithm for arbitrary contextfree grammars. This algorithm uses an LR transition network which is similar to a shift reduce table used by standard ...LR parsing algorithm. It runs in linear time for n (where n is a length of the string being parsed) ; it needs O (n2) processes, and O (n2) spaces.show more
|
Export Mendeley
p339