To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
Efficient tree construction for formal language query processing |
|
Author |
K.B. Madhuri, M. Shashi, P.G. Krishna Mohan |
| Citation |
Vol. 7 No. 3 pp. 40-48 |
|
Abstract |
This paper describes the construction of a tree for a given database of strings for formal language query processing. A query can be presented in the form of a Regular Expression (RE) or a Context-Free Grammar (CFG). A special structure for representing the query which can be used for efficient searching is also described. This special structure is a parse tree in the case of a regular expression and Greibach normal form in the case of a context-free grammar. The proposed algorithms are a preprocessing step for search algorithms which bypass the construction of a separate automaton for a given query. |
|
Keywords |
n?ary tree, Regular Expression, Parse Tree, Context-Free Grammar, Greibach normal form |
|
URL |
