Content deleted Content added
titled untitled thread |
→Explain practical parse tree generation!: corrected indention for reply |
||
Line 6:
given a string,the algortithm could give how it comes from the start S,
show how many ways it can be ,or even give the shortest way.
:It sounds like you're asking about parse trees... the page mentions that the algorithm is easy to modify to find a parse tree (or several). This would show you how to construct the string from the rules. I *think* that with Chomsky normal form, all derivations are the same length, but I'm not really an expert...▼
▲It sounds like you're asking about parse trees... the page mentions that the algorithm is easy to modify to find a parse tree (or several). This would show you how to construct the string from the rules. I *think* that with Chomsky normal form, all derivations are the same length, but I'm not really an expert...
This page is great. However - it would incredible with a few examples to lead readers through the process.
| |||