Deterministic parsing with P colony automata

E. Csuhaj-Varjú, Kristóf Kántor, György Vaszil

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages88-98
Number of pages11
DOIs
Publication statusPublished - Jan 1 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11270 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Context free languages
Context free grammars
Parsing
Automata
Context-free Languages
Context-free Grammar
Look-ahead
Backtracking
Computing
Language

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Csuhaj-Varjú, E., Kántor, K., & Vaszil, G. (2018). Deterministic parsing with P colony automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 88-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11270 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-00265-7_8

Deterministic parsing with P colony automata. / Csuhaj-Varjú, E.; Kántor, Kristóf; Vaszil, György.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, 2018. p. 88-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11270 LNCS).

Research output: Chapter in Book/Report/Conference proceedingChapter

Csuhaj-Varjú, E, Kántor, K & Vaszil, G 2018, Deterministic parsing with P colony automata. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11270 LNCS, Springer Verlag, pp. 88-98. https://doi.org/10.1007/978-3-030-00265-7_8
Csuhaj-Varjú E, Kántor K, Vaszil G. Deterministic parsing with P colony automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2018. p. 88-98. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-00265-7_8
Csuhaj-Varjú, E. ; Kántor, Kristóf ; Vaszil, György. / Deterministic parsing with P colony automata. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, 2018. pp. 88-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inbook{5eb133201a1d40b6b63205cb08462474,
title = "Deterministic parsing with P colony automata",
abstract = "We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.",
author = "E. Csuhaj-Varj{\'u} and Krist{\'o}f K{\'a}ntor and Gy{\"o}rgy Vaszil",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-00265-7_8",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "88--98",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - CHAP

T1 - Deterministic parsing with P colony automata

AU - Csuhaj-Varjú, E.

AU - Kántor, Kristóf

AU - Vaszil, György

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.

AB - We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by (generalized) P colony automata. We define a subclass of these computing devices satisfying a property which resembles the LL(k) property of context-free grammars, and study the possibility of parsing the characterized languages using a k symbol lookahead, as in the LL(k) parsing method for context-free languages.

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

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

U2 - 10.1007/978-3-030-00265-7_8

DO - 10.1007/978-3-030-00265-7_8

M3 - Chapter

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 88

EP - 98

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -