91影视

Context free language is generated by the context free grammar. A language is said to be context free , if it is accepted by the push down automata.

Consider a parse tree of any grammar $G=\left(V,T,R,S\right)$ ,

Where, $S$start symbol is a root abd the $V$ non-terminals are interior nodes and the terminals $T$ represents the leaf nodes of the parse tree.

Each terminal string generated by grammar G has parse tree.

The Theorem 7.16 states that every context free languages is a member of class P. The modified algorithm to produce a polynomial time algorithm is as follows,

Modified Algorithm:

$D=$鈥淥n input$s=s_1{s}_2鈥�s_n$ and CFG G

$\text{ParseTree}鈫�\left(\text{Initial}S鈥�\text{tree},鈥�\text{Beginning}鈥�\text{of}鈥�\text{the}鈥�\text{string}鈥�s\right)$

$\text{CurrentState}鈫�\text{POP the ParseTree}$

repeat for $i=1,2,3,4,鈥�n$

if parsing is successful for CurrentState

return TREE(CurrentState)

else

if no nodes to expand

return reject

else

$temp鈫�\text{Apply the CFG}鈥�\text{rules}鈥�\text{on}鈥�\text{CurrentState}$

PUSH temp into the Parse Tree

if ParseTree is empty

return reject

else

$\text{CurrentState}鈫�\text{NEXT}\left(\text{ParseTree}\right)$

returnParseTree

The above algorithm takes the string and apply the rules on it. For each part of the string rules are applied and the next node is found.

Each state is added to the tree. If the input is processed completely then it returns the parse tree.

Therefore, the modified algorithm has been provided.