| [2557] | 1 | Write Texinfo documentation for grep. The manual page would be a good
|
|---|
| 2 | place to start, but Info documents are also supposed to contain a
|
|---|
| 3 | tutorial and examples.
|
|---|
| 4 |
|
|---|
| 5 | Fix the DFA matcher to never use exponential space. (Fortunately, these
|
|---|
| 6 | cases are rare.)
|
|---|
| 7 |
|
|---|
| 8 | Improve the performance of the regex backtracking matcher. This matcher
|
|---|
| 9 | is agonizingly slow, and is responsible for grep sometimes being slower
|
|---|
| 10 | than Unix grep when backreferences are used.
|
|---|
| 11 |
|
|---|
| 12 | Provide support for the Posix [= =] and [. .] constructs. This is
|
|---|
| 13 | difficult because it requires locale-dependent details of the character
|
|---|
| 14 | set and collating sequence, but Posix does not standardize any method
|
|---|
| 15 | for accessing this information!
|
|---|
| 16 |
|
|---|
| 17 | ##
|
|---|
| 18 |
|
|---|
| 19 | Some test in tests/spencer2.tests should have failed !!!
|
|---|
| 20 | Need to filter out some bugs in dfa.[ch]/regex.[ch].
|
|---|
| 21 |
|
|---|
| 22 | Threads for grep ?
|
|---|
| 23 |
|
|---|
| 24 | Grep does 32 bits arithmetic, it needs to move to 64.
|
|---|
| 25 |
|
|---|
| 26 | Clean up, to many #ifdef's !!
|
|---|
| 27 |
|
|---|
| 28 | Check some new Algorithms for matching, talk to Karl Berry and Nelson.
|
|---|
| 29 | Sunday's "Quick Search" Algorithm (CACM 33, 8 August 1990 pp. 132-142)
|
|---|
| 30 | claim that his algo. is faster then Boyer-More ????
|
|---|
| 31 | Worth Checking.
|
|---|
| 32 |
|
|---|
| 33 | Take a look at cgrep (Context grep) seems like nice work.
|
|---|
| 34 | Take a look at sgrep (Struct grep).
|
|---|
| 35 | Take a look at agrep (Approximate grep), from glimpse.
|
|---|
| 36 | Can we merge ?
|
|---|
| 37 |
|
|---|
| 38 | POSIX Compliance see p10003.x
|
|---|
| 39 |
|
|---|
| 40 | Moving away from GNU regex API for POSIX regex API.
|
|---|
| 41 |
|
|---|
| 42 | Better and faster !!
|
|---|
