Standard

CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD. / Grafeeva, N. G.

в: Programming and Computer Software (English Translation of Programmirovanie), Том 7, № 2, 01.01.1981, стр. 86-90.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Grafeeva, NG 1981, 'CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD.', Programming and Computer Software (English Translation of Programmirovanie), Том. 7, № 2, стр. 86-90.

APA

Grafeeva, N. G. (1981). CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD. Programming and Computer Software (English Translation of Programmirovanie), 7(2), 86-90.

Vancouver

Grafeeva NG. CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD. Programming and Computer Software (English Translation of Programmirovanie). 1981 Янв. 1;7(2):86-90.

Author

Grafeeva, N. G. / CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD. в: Programming and Computer Software (English Translation of Programmirovanie). 1981 ; Том 7, № 2. стр. 86-90.

BibTeX

@article{89434d8cc6e74f8cb6736f8ddc9cfc5c,
title = "CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD.",
abstract = "The article considers sufficient conditions for efficient parsing without backtracking of context-free grammars by Unger's method, using a system of tests.",
author = "Grafeeva, {N. G.}",
year = "1981",
month = jan,
day = "1",
language = "English",
volume = "7",
pages = "86--90",
journal = "Programming and Computer Software",
issn = "0361-7688",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "2",

}

RIS

TY - JOUR

T1 - CLASS OF GRAMMARS WHICH ALLOW PARSING WITHOUT BACKTRACKING BY UNGER'S METHOD.

AU - Grafeeva, N. G.

PY - 1981/1/1

Y1 - 1981/1/1

N2 - The article considers sufficient conditions for efficient parsing without backtracking of context-free grammars by Unger's method, using a system of tests.

AB - The article considers sufficient conditions for efficient parsing without backtracking of context-free grammars by Unger's method, using a system of tests.

UR - http://www.scopus.com/inward/record.url?scp=0019536016&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0019536016

VL - 7

SP - 86

EP - 90

JO - Programming and Computer Software

JF - Programming and Computer Software

SN - 0361-7688

IS - 2

ER -

ID: 48949294