1 files changed, 32 insertions, 31 deletions

diff --git a/src/MoonP/ast.cpp b/src/MoonP/ast.cpp
index 7cdefba..71c90c5 100644
--- a/src/MoonP/ast.cpp
+++ b/src/MoonP/ast.cpp
@@ -1,12 +1,13 @@
 /* Copyright (c) 2012, Achilleas Margaritis, modified by Jin Li
 All rights reserved.
 
-        Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
 
-        Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
-        Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
 
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
+Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.*/
 
 #include <cassert>
 #include "MoonP/ast.hpp"
@@ -48,20 +49,20 @@ bool ast_node::visitChild(const std::function<bool (ast_node*)>&) {
         return false;
 }
 
-    
+        
 /** Asks all members to construct themselves from the stack.
-    The members are asked to construct themselves in reverse order.
-    from a node stack.
-    @param st stack.
- */
+        The members are asked to construct themselves in reverse order.
+        from a node stack.
+        @param st stack.
+*/
 void ast_container::construct(ast_stack &st) {
-    for(ast_member_vector::reverse_iterator it = m_members.rbegin();
-        it != m_members.rend();
-        ++it)
-    {
-        ast_member* member = *it;
-        member->construct(st);
-    }
+        for(ast_member_vector::reverse_iterator it = m_members.rbegin();
+                it != m_members.rend();
+                ++it)
+        {
+                ast_member* member = *it;
+                member->construct(st);
+        }
 }
 
 traversal ast_container::traverse(const std::function<traversal (ast_node*)>& func) {
@@ -108,24 +109,24 @@ bool ast_container::visitChild(const std::function<bool (ast_node*)>& func) {
 
 
 /** parses the given input.
-    @param i input.
-    @param g root rule of grammar.
-    @param el list of errors.
-    @param ud user data, passed to the parse procedures.
-    @return pointer to ast node created, or null if there was an error.
-        The return object must be deleted by the caller.
- */
-ast_node* parse(input &i, rule &g, error_list &el, void* ud) {
-    ast_stack st;
-    if (!parse(i, g, el, &st, ud)) {
-        for (auto node : st) {
-                delete node;
+        @param i input.
+        @param g root rule of grammar.
+        @param el list of errors.
+        @param ud user data, passed to the parse procedures.
+        @return pointer to ast node created, or null if there was an error.
+                The return object must be deleted by the caller.
+*/
+ast_node* parse(input& i, rule& g, error_list& el, void* ud) {
+        ast_stack st;
+        if (!parse(i, g, el, &st, ud)) {
+                for (auto node : st) {
+                        delete node;
                 }
                 st.clear();
-        return nullptr;
+                return nullptr;
         }
-    assert(st.size() == 1);
-    return st.front();
+        assert(st.size() == 1);
+        return st.front();
 }