Geodesic
On translating context-free grammars into Lambek grammars
Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 72-79

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider context-free grammars and Lambek grammars enriched with semantic labeling. Such grammars do not just answer whether a given word belongs to the language described by the grammar, but, if the answer is positive, also assign the word a $\lambda $-term that corresponds to the semantic value (“meaning”) of the word. We present a modification of W. Buszkowski's direct translation of context-free grammars in the Chomsky normal form into Lambek grammars; this modification preserves semantic values of words. 
@article{TRSPY_2015_290_a5,
     author = {S. L. Kuznetsov},
     title = {On translating context-free grammars into {Lambek} grammars},
     journal = {Informatics and Automation},
     pages = {72--79},
     publisher = {mathdoc},
     volume = {290},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a5/}
}
TY  - JOUR
AU  - S. L. Kuznetsov
TI  - On translating context-free grammars into Lambek grammars
JO  - Informatics and Automation
PY  - 2015
SP  - 72
EP  - 79
VL  - 290
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a5/
LA  - ru
ID  - TRSPY_2015_290_a5
ER  - 
%0 Journal Article
%A S. L. Kuznetsov
%T On translating context-free grammars into Lambek grammars
%J Informatics and Automation
%D 2015
%P 72-79
%V 290
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a5/
%G ru
%F TRSPY_2015_290_a5
S. L. Kuznetsov. On translating context-free grammars into Lambek grammars. Informatics and Automation, Modern problems of mathematics, mechanics, and mathematical physics, Tome 290 (2015), pp. 72-79. http://geodesic.mathdoc.fr/item/TRSPY_2015_290_a5/