You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

DotOutputter.java 2.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
  1. /*
  2. * Copyright (c) 2006-2010 Chris Smith, Shane Mc Cormack, Gregory Holmes
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a copy
  5. * of this software and associated documentation files (the "Software"), to deal
  6. * in the Software without restriction, including without limitation the rights
  7. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  8. * copies of the Software, and to permit persons to whom the Software is
  9. * furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  19. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  20. * SOFTWARE.
  21. */
  22. package com.dmdirc.addons.calc;
  23. import java.text.ParseException;
  24. /**
  25. * Outputs a string which can be read by the unix `dot` utility to show a
  26. * directed graph showing the tokens parsed by a {@link Parser}.
  27. *
  28. * @author chris
  29. */
  30. public class DotOutputter {
  31. /** The parser which will be read. */
  32. private final Parser parser;
  33. /** Counter for assigning node IDs. */
  34. private int nodes = 0;
  35. /**
  36. * Creates a new DotOutputter for the specified parser.
  37. *
  38. * @param parser The parser whose output should be shown
  39. */
  40. public DotOutputter(final Parser parser) {
  41. this.parser = parser;
  42. }
  43. /**
  44. * Outputs a string which may be read by the `dot` utility to create a
  45. * directed graph of tokens.
  46. *
  47. * @return A string describing the parse tree from the specified parser
  48. * @throws ParseException If the parser encounters an exception
  49. */
  50. public String output() throws ParseException {
  51. return "digraph astoutput { " + output(0, parser.parse()) + " }";
  52. }
  53. /**
  54. * Outputs the relevant text for the specified token, assigning it an ID
  55. * specified by the node parameter.
  56. *
  57. * @param node The ID of the node to be used in the output
  58. * @param token The token to be outputted
  59. * @return A string corresponding to the dot representation of the
  60. * specified node and its children
  61. */
  62. protected String output(final int node, final TreeToken token) {
  63. String out = "node" + node + " [label=\"" + token.getToken().getType()
  64. + "\\n" + token.getToken().getContent() + "\"];";
  65. for (TreeToken child : token.getChildren()) {
  66. int id = ++nodes;
  67. out += output(id, child);
  68. out += "node" + node + " -> node" + id + ";";
  69. }
  70. return out;
  71. }
  72. }