Content deleted Content added
No edit summary |
No edit summary |
||
Line 4:
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...
| |||