|Earley Algorithm firstname.lastname@example.org (Malaussène) (2002-04-19)|
|Date:||19 Apr 2002 11:27:37 -0400|
|Organization:||Wanadoo, l'internet avec France Telecom|
|Posted-Date:||19 Apr 2002 11:27:37 EDT|
[Yesterday, i had posted in comp.development. Someone advise to me to post
in this newsgroup.]
I search information about the algorithm for generate the syntactic
tree (with the item's table generate by Earley's algorithm). The
simple method which consists to create the sub-tree as and when
required, didn't run with the ambigous grammar. Jay Earley explained
in his book the different methods (but, i haven't it!).
I saw in the site in berkley's site that i would used the Viterbi
algorithm. It's complex algorithm and it implementation must be
complex. If a person could explain me it, i will be happy !!!
Thanks in advance
[Sorry about my spelling mistake, i'm french.]
Return to the
Search the comp.compilers archives again.