Parsing Based on Grammar and Automata Systems

Abstract

This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focusing especially on impacts of nondeterminism in individual components on the whole system. Also it introduces a proposal of algorithm for converting some parallel communicating grammar systems to parallel communicating pushdown automata systems. The gained knowledge is used to design and implement parsing method

Similar works

Full text

thumbnail-image

National Repository of Grey Literature

redirect
Last time updated on 10/08/2016

This paper was published in National Repository of Grey Literature.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.