KLL Compiler
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.
This repo is archived. You can view files and clone it, but cannot push or open issues/pull-requests.

util.py 1.9KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849
  1. # -*- coding: utf-8 -*-
  2. # Copyright (c) 2008/2013 Andrey Vlasovskikh
  3. #
  4. # Permission is hereby granted, free of charge, to any person obtaining
  5. # a copy of this software and associated documentation files (the
  6. # "Software"), to deal in the Software without restriction, including
  7. # without limitation the rights to use, copy, modify, merge, publish,
  8. # distribute, sublicense, and/or sell copies of the Software, and to
  9. # permit persons to whom the Software is furnished to do so, subject to
  10. # the following conditions:
  11. #
  12. # The above copyright notice and this permission notice shall be included
  13. # in all copies or substantial portions of the Software.
  14. #
  15. # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  16. # EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  17. # MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
  18. # IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
  19. # CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  20. # TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  21. # SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  22. def pretty_tree(x, kids, show):
  23. """(a, (a -> list(a)), (a -> str)) -> str
  24. Returns a pseudographic tree representation of x similar to the tree command
  25. in Unix.
  26. """
  27. (MID, END, CONT, LAST, ROOT) = ('|-- ', '`-- ', '| ', ' ', '')
  28. def rec(x, indent, sym):
  29. line = indent + sym + show(x)
  30. xs = kids(x)
  31. if len(xs) == 0:
  32. return line
  33. else:
  34. if sym == MID:
  35. next_indent = indent + CONT
  36. elif sym == ROOT:
  37. next_indent = indent + ROOT
  38. else:
  39. next_indent = indent + LAST
  40. syms = [MID] * (len(xs) - 1) + [END]
  41. lines = [rec(x, next_indent, sym) for x, sym in zip(xs, syms)]
  42. return '\n'.join([line] + lines)
  43. return rec(x, '', ROOT)