A polynomial-time parsing algorithm for \(K\)-depth languages (Q1915505): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jcss.1996.0006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012906089 / rank | |||
Normal rank | |||
Latest revision as of 00:38, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time parsing algorithm for \(K\)-depth languages |
scientific article |
Statements
A polynomial-time parsing algorithm for \(K\)-depth languages (English)
0 references
16 July 1996
0 references
\(K\)-depth grammars
0 references
context-free grammars
0 references
