| W97-1515 | grammars are processed by top-down | depth-first parsers | . All parsers have specific problems |
| P83-1023 | , the control structure for a | depth-first parser | described earlier is used . To |
| E03-3004 | developed left-recursive , top-down , | depth-first parser | , implemented in Sicstus Prolog |
| H93-1009 | modi - fier . Thus a top-down | depth-first parser | can keep seeking a noun modifier |
| C82-1054 | , the control structure for a | depth-first parser | described earlier is used . To |
| P81-1001 | experiments was LIFER : a top-down , | depth-first parser | with automatic back-up -LSB- |
| P98-1048 | 1994 -RSB- : it is a top-down , | depth-first parser | , augmented with a few look-ahead |
| W97-1515 | properties of a grammar , e.g. topdown | depth-first parsers | may run into infinite loops if |
| C88-1082 | than 10 % of the time for the | depth-first parser | , and to approximately 90 % of |
| J79-1032 | down from the start to say , a | depth-first parser | . Meta-parsers also have a certain |
