Disclaimer: Dieser Thread wurde aus dem alten Forum importiert. Daher werden eventuell nicht alle Formatierungen richtig angezeigt. Der ursprüngliche Thread beginnt im zweiten Post dieses Threads.
Problem 3.1 - expansion order
I’m not quite sure I understand the description of problem 3.1 correctly. A DFS for example would not expand left-recursively but follow the alphabetical order?
E.g. A->B->C instead of A->B->D ?
The problem asks that you use alphabetical order when no other order is specified by the search. In the case of DFS, the order is always specified by search, i.e., left-recursively.
I hope this helps!
Yes, that helps. Thank you.