Detail publikace

Scattered Context Grammars Parsers

Originální název

Scattered Context Grammars Parsers

Anglický název

Scattered Context Grammars Parsers

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

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"
}