An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules (Q442111)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An extended Earley's algorithm for Petri net controlled grammars without rules and cyclic rules |
scientific article; zbMATH DE number 6064507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules |
scientific article; zbMATH DE number 6064507 |
Statements
An extended Earley's algorithm for Petri net controlled grammars without \(\lambda\) rules and cyclic rules (English)
0 references
9 August 2012
0 references
context-free grammar
0 references
context-sensitive grammar
0 references
Petri net
0 references
controlled grammar
0 references
Earley's algorithm
0 references
0.8982704281806946
0 references
0.8405653834342957
0 references
0.8397940993309021
0 references
0.838871419429779
0 references
0.8078563213348389
0 references
