Standard

Recursive descent parsing for Boolean grammars. / Okhotin, Alexander.

в: Acta Informatica, Том 44, № 3-4, 01.07.2007, стр. 167-189.

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

Harvard

Okhotin, A 2007, 'Recursive descent parsing for Boolean grammars', Acta Informatica, Том. 44, № 3-4, стр. 167-189. https://doi.org/10.1007/s00236-007-0045-0

APA

Okhotin, A. (2007). Recursive descent parsing for Boolean grammars. Acta Informatica, 44(3-4), 167-189. https://doi.org/10.1007/s00236-007-0045-0

Vancouver

Okhotin A. Recursive descent parsing for Boolean grammars. Acta Informatica. 2007 Июль 1;44(3-4):167-189. https://doi.org/10.1007/s00236-007-0045-0

Author

Okhotin, Alexander. / Recursive descent parsing for Boolean grammars. в: Acta Informatica. 2007 ; Том 44, № 3-4. стр. 167-189.

BibTeX

@article{0325f470c2794d469b300283205009db,
title = "Recursive descent parsing for Boolean grammars",
abstract = "The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.",
author = "Alexander Okhotin",
year = "2007",
month = jul,
day = "1",
doi = "10.1007/s00236-007-0045-0",
language = "English",
volume = "44",
pages = "167--189",
journal = "Acta Informatica",
issn = "0001-5903",
publisher = "Springer Nature",
number = "3-4",

}

RIS

TY - JOUR

T1 - Recursive descent parsing for Boolean grammars

AU - Okhotin, Alexander

PY - 2007/7/1

Y1 - 2007/7/1

N2 - The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.

AB - The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.

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

U2 - 10.1007/s00236-007-0045-0

DO - 10.1007/s00236-007-0045-0

M3 - Article

AN - SCOPUS:34347358568

VL - 44

SP - 167

EP - 189

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

IS - 3-4

ER -

ID: 41141492