dump.c 1.2 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include <regexp.h>
  5. #include "/sys/src/libregexp/regcomp.h"
  6. #include "dfa.h"
  7. #define DUMP
  8. void
  9. dump(Dreprog *pp)
  10. {
  11. int i, j;
  12. Dreinst *l;
  13. print("start %ld %ld %ld %ld\n",
  14. pp->start[0]-pp->inst,
  15. pp->start[1]-pp->inst,
  16. pp->start[2]-pp->inst,
  17. pp->start[3]-pp->inst);
  18. for(i=0; i<pp->ninst; i++){
  19. l = &pp->inst[i];
  20. print("%d:", i);
  21. for(j=0; j<l->nc; j++){
  22. print(" [");
  23. if(j == 0)
  24. if(l->c[j].start > 1)
  25. print("<bad start %d>\n", l->c[j].start);
  26. if(j != 0)
  27. print("%C%s", l->c[j].start&0xFFFF, (l->c[j].start&0x10000) ? "$" : "");
  28. print("-");
  29. if(j != l->nc-1)
  30. print("%C%s", (l->c[j+1].start&0xFFFF)-1, (l->c[j+1].start&0x10000) ? "$" : "");
  31. print("] %ld", l->c[j].next - pp->inst);
  32. }
  33. if(l->isfinal)
  34. print(" final");
  35. if(l->isloop)
  36. print(" loop");
  37. print("\n");
  38. }
  39. }
  40. void
  41. main(int argc, char **argv)
  42. {
  43. int i;
  44. Reprog *p;
  45. Dreprog *dp;
  46. i = 1;
  47. p = regcomp(argv[i]);
  48. if(p == 0){
  49. print("=== %s: bad regexp\n", argv[i]);
  50. }
  51. // print("=== %s\n", argv[i]);
  52. // rdump(p);
  53. dp = dregcvt(p);
  54. print("=== dfa\n");
  55. dump(dp);
  56. for(i=2; i<argc; i++)
  57. print("match %d\n", dregexec(dp, argv[i], 1));
  58. exits(0);
  59. }