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.

92 lines
3.5 KiB

  1. /*
  2. * This program source code file is part of KiCad, a free EDA CAD application.
  3. *
  4. * Copyright (C) 2013 SoftPLC Corporation, Dick Hollenbeck <dick@softplc.com>
  5. * Copyright (C) 2013-2020 KiCad Developers, see AUTHORS.txt for contributors.
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; either version 2
  10. * of the License, or (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, you may find one here:
  19. * http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
  20. * or you may search the http://www.gnu.org website for the version 2 license,
  21. * or you may write to the Free Software Foundation, Inc.,
  22. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
  23. */
  24. #ifndef PTREE_H_
  25. #define PTREE_H_
  26. /*
  27. Implement "KiCad s-expression" support for boost::property_tree's ptree, the 8
  28. bit string version of property_tree. The ram resident structure of the ptree is
  29. mostly compatible with one created using the xml_parser from
  30. boost::property_tree, with slight differences in the way atoms are stored. The
  31. result is you can use Format() to convert from xml to s-expression, but not the
  32. other way around. You can write a simple s-expression beautifier in just a few
  33. lines of code.
  34. The main value however is the s-expression parser, i.e. Scan(), which is an
  35. alternative to crafting a custom recursive descent parser for a particular
  36. grammar. The tipping point depends on whether you want to read only a small
  37. portion of a much larger document. If so, then using the ptree will likely be a
  38. "faster to code" route. Documentation on how to navigate a ptree can be found on
  39. the boost website and there are a number of examples in the
  40. pcbnew/eagle_plugin.cpp file in this project. Powerful path navigation support
  41. makes it easy to extract a subset of a ptree.
  42. */
  43. #include <boost/property_tree/ptree_fwd.hpp>
  44. #include <richio.h>
  45. #include <dsnlexer.h>
  46. typedef boost::property_tree::ptree PTREE;
  47. typedef const PTREE CPTREE;
  48. typedef boost::property_tree::ptree_error PTREE_ERROR;
  49. /**
  50. * Fill an empty #PTREE with information from a KiCad s-expression stream.
  51. *
  52. * Use a #DSNLEXER with an empty keyword table as @a aLexer. Useful for parsing s-expression
  53. * files or strings of arbitrary grammars, say from a file or clipboard. The s-expression
  54. * must be "KiCad compatible". See Documentation/s-expressions.txt for this KiCad compatible
  55. * definition (it is the non-specctra mode). And also see in tools/property_tree.cpp for
  56. * example usage.
  57. *
  58. * <code>
  59. *
  60. * FILE* fp = fopen( argv[1], "r" );
  61. *
  62. * static const KEYWORD empty_keywords[1] = {};
  63. *
  64. * DSNLEXER lexer( empty_keywords, 0, fp, wxString( FROM_UTF8( argv[1] ) ) );
  65. *
  66. * try
  67. * {
  68. * PTREE doc;
  69. * Scan( &doc, &lexer );
  70. * }
  71. * catch( const IO_ERROR& ioe )
  72. * {
  73. * fprintf( stderr, "%s\n", TO_UTF8( ioe.errorText ) );
  74. * }
  75. *
  76. * </code>
  77. */
  78. void Scan( PTREE* aTree, DSNLEXER* aLexer );
  79. /**
  80. * Output a #PTREE into s-expression format via an #OUTPUTFORMATTER derivative.
  81. */
  82. void Format( OUTPUTFORMATTER* out, int aNestLevel, int aCtl, const CPTREE& aTree );
  83. #endif // PTREE_H_