A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.
β¦ LIBER β¦
A method for inferring context-free grammars
β Scribed by Bruce Knobe; Kathleen Knobe
- Book ID
- 114037183
- Publisher
- Elsevier Science
- Year
- 1976
- Weight
- 661 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0019-9958
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A method for the inference of non-recurs
β
C. Chirathamjaree; Martin H. Ackroyd
π
Article
π
1980
π
Elsevier Science
β 438 KB
Inferring Context-Free Grammars for Doma
β
Matej ΔrepinΕ‘ek; Marjan Mernik; Barrett R. Bryant; Faizan Javed; Alan Sprague
π
Article
π
2005
π
Elsevier Science
π
English
β 368 KB
Inferability of context-free programmed
β
H. R. Lu; K. S. Fu
π
Article
π
1984
π
Springer
π
English
β 987 KB
Remarks on the structural grammatical in
β
Erkki MΓ€kinen
π
Article
π
1992
π
Elsevier Science
π
English
β 266 KB
A homomorphism theorem for weighted cont
β
Donald F. Stanat
π
Article
π
1972
π
Elsevier Science
π
English
β 731 KB
Productions of a context-free grammar can be given coefficients from semirings, inducing weights for both derivations in the grammar and strings over the terminal alphabet. For a weighted context-free grammar in Greibach normal form, the weight of any string, as well as the set of derivations of the
A useful lemma for context-free programm
β
Jan Leeuwen
π
Article
π
1979
π
Springer-Verlag
π
English
β 663 KB