We have a browser-based application. It has a combo-like component that contains a hierarchy like this. Menu items can be expanded and collapsed:
menuitem1 submenuitem1 itemA itemB submenuitem2 menuitem2 submenuitem1 itemA itemM itemP ...
Note that a few of these items appear more than once (here ItemA) so searching for ItemA in the supplied search field won’t function safely.
I work on the idea that with a given text and the knowledge on which menu item and submenu item I need to go to, I can map this to a set of keystrokes e.g. “ItemA[k(down)][k(down)][k(down)][k(enter)]” (these keystrokes won’t find ItemA here, just an example).
The tree structure has been static but may change without warning
I figure that I need a better idea. Anyone got one? Is data scraping the tree an option?
Thanks in advance.