Publication detail

Scattered Context Grammars Parsers

KOLÁŘ, D.

Original Title

Scattered Context Grammars Parsers

English Title

Scattered Context Grammars Parsers

Type

conference paper

Language

en

Original Abstract

There are several efficient parsing techniques used for analysis of context-free languages.  Nevertheless, context bindings must be recognized and verified by some other (less formal) means, e.g. symbol tables, semantic actions, attributed grammars, etc.  The paper presents a restricted variant of scattered context grammars and a deterministic version of regulated pushdown automata. These formal means together represent an efficient formal system for parsing of context languages. Moreover, construction of a deterministic regulated pushdown automaton from the restricted scattered context grammar is also possible.

English abstract

There are several efficient parsing techniques used for analysis of context-free languages.  Nevertheless, context bindings must be recognized and verified by some other (less formal) means, e.g. symbol tables, semantic actions, attributed grammars, etc.  The paper presents a restricted variant of scattered context grammars and a deterministic version of regulated pushdown automata. These formal means together represent an efficient formal system for parsing of context languages. Moreover, construction of a deterministic regulated pushdown automaton from the restricted scattered context grammar is also possible.

Keywords

scattered context grammars, context languages, parsers, regulated pushdown automata

RIV year

2008

Released

14.09.2008

Publisher

Wroclaw University of Technology

Location

Wroclaw

ISBN

978-83-7493-400-8

Book

Proceedings of the 14th International Congress of Cybernetics and Systems of WOCS

Edition

NEUVEDEN

Edition number

NEUVEDEN

Pages from

491

Pages to

500

Pages count

10

Documents

BibTex


@inproceedings{BUT32112,
  author="Dušan {Kolář}",
  title="Scattered Context Grammars Parsers",
  annote="There are several efficient parsing techniques used for analysis of context-free
languages.  Nevertheless, context bindings must be recognized and verified by
some other (less formal) means, e.g. symbol tables, semantic actions, attributed
grammars, etc.  The paper presents a restricted variant of scattered context
grammars and a deterministic version of regulated pushdown automata. These formal
means together represent an efficient formal system for parsing of context
languages. Moreover, construction of a deterministic regulated pushdown automaton
from the restricted scattered context grammar is also possible.",
  address="Wroclaw University of Technology",
  booktitle="Proceedings of the  14th International Congress of Cybernetics and Systems of WOCS",
  chapter="32112",
  edition="NEUVEDEN",
  howpublished="print",
  institution="Wroclaw University of Technology",
  year="2008",
  month="september",
  pages="491--500",
  publisher="Wroclaw University of Technology",
  type="conference paper"
}