# Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars

## TL;DR

This paper introduces a top-down parsing method for graph grammars to reduce time complexity.

## Contribution

A novel top-down parsing method is proposed to reduce the complexity of context-sensitive graph grammar parsing.

## Key findings

- The top-down method avoids subgraph isomorphism judgment.
- The new method significantly reduces time complexity compared to bottom-up approaches.

## Abstract

The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply. In order to reduce the time-complexity, this paper uses the top-down method for parsing. This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time-complexity is greatly reduced.