Skip to content

Commit

Permalink
2 space indentation
Browse files Browse the repository at this point in the history
  • Loading branch information
petermlm committed Apr 17, 2016
1 parent af64891 commit aa17e07
Show file tree
Hide file tree
Showing 2 changed files with 69 additions and 69 deletions.
110 changes: 55 additions & 55 deletions examples/tree_traversal.c
Original file line number Diff line number Diff line change
Expand Up @@ -2,72 +2,72 @@

int main(int argc, char *argv[]) {

mpc_parser_t *Input = mpc_new("input");
mpc_parser_t *Node = mpc_new("node");
mpc_parser_t *Leaf = mpc_new("leaf");
mpc_ast_t *ast, *tree, *child, *child_sub;
mpc_result_t r;
int index, lb;

mpca_lang(MPCA_LANG_PREDICTIVE,
" node : '(' <node> ',' /foo/ ',' <node> ')' | <leaf>;"
" leaf : /bar/;"
" input : /^/ <node> /$/;",
Node, Leaf, Input, NULL);

if (argc > 1) {

if (mpc_parse_contents(argv[1], Input, &r)) {
ast = r.output;
} else {
mpc_err_print(r.error);
mpc_err_delete(r.error);
mpc_cleanup(3, Node, Leaf, Input);
return EXIT_FAILURE;
}

mpc_parser_t *Input = mpc_new("input");
mpc_parser_t *Node = mpc_new("node");
mpc_parser_t *Leaf = mpc_new("leaf");
mpc_ast_t *ast, *tree, *child, *child_sub;
mpc_result_t r;
int index, lb;

mpca_lang(MPCA_LANG_PREDICTIVE,
" node : '(' <node> ',' /foo/ ',' <node> ')' | <leaf>;"
" leaf : /bar/;"
" input : /^/ <node> /$/;",
Node, Leaf, Input, NULL);

if (argc > 1) {

if (mpc_parse_contents(argv[1], Input, &r)) {
ast = r.output;
} else {
mpc_err_print(r.error);
mpc_err_delete(r.error);
mpc_cleanup(3, Node, Leaf, Input);
return EXIT_FAILURE;
}

if (mpc_parse_pipe("<stdin>", stdin, Input, &r)) {
ast = r.output;
} else {
mpc_err_print(r.error);
mpc_err_delete(r.error);
mpc_cleanup(3, Node, Leaf, Input);
return EXIT_FAILURE;
}
} else {

if (mpc_parse_pipe("<stdin>", stdin, Input, &r)) {
ast = r.output;
} else {
mpc_err_print(r.error);
mpc_err_delete(r.error);
mpc_cleanup(3, Node, Leaf, Input);
return EXIT_FAILURE;
}

/* Get index or child of tree */
tree = ast->children[1];
}

index = mpc_ast_get_index(tree, "node|>");
child = mpc_ast_get_child(tree, "node|>");
/* Get index or child of tree */
tree = ast->children[1];

if(child == NULL) {
mpc_cleanup(3, Node, Leaf, Input);
mpc_ast_delete(ast);
return EXIT_FAILURE;
}
index = mpc_ast_get_index(tree, "node|>");
child = mpc_ast_get_child(tree, "node|>");

if(child == NULL) {
mpc_cleanup(3, Node, Leaf, Input);
mpc_ast_delete(ast);
return EXIT_FAILURE;
}

printf("Index: %d; Child: \"%s\"\n", index, child->tag);
printf("Index: %d; Child: \"%s\"\n", index, child->tag);

/* Get multiple indexes or children of trees */
index = mpc_ast_get_index_lb(child, "node|leaf|regex", 0);
child_sub = mpc_ast_get_child_lb(child, "node|leaf|regex", 0);
/* Get multiple indexes or children of trees */
index = mpc_ast_get_index_lb(child, "node|leaf|regex", 0);
child_sub = mpc_ast_get_child_lb(child, "node|leaf|regex", 0);

while(index != -1) {
printf("-- Index: %d; Child: \"%s\"\n", index, child_sub->tag);
while(index != -1) {
printf("-- Index: %d; Child: \"%s\"\n", index, child_sub->tag);

lb = index + 1;
index = mpc_ast_get_index_lb(child, "node|leaf|regex", lb);
child_sub = mpc_ast_get_child_lb(child, "node|leaf|regex", lb);
}
lb = index + 1;
index = mpc_ast_get_index_lb(child, "node|leaf|regex", lb);
child_sub = mpc_ast_get_child_lb(child, "node|leaf|regex", lb);
}

/* Clean up and return */
mpc_cleanup(3, Node, Leaf, Input);
mpc_ast_delete(ast);
/* Clean up and return */
mpc_cleanup(3, Node, Leaf, Input);
mpc_ast_delete(ast);

return EXIT_SUCCESS;
return EXIT_SUCCESS;
}
28 changes: 14 additions & 14 deletions mpc.c
Original file line number Diff line number Diff line change
Expand Up @@ -2777,35 +2777,35 @@ void mpc_ast_print_to(mpc_ast_t *a, FILE *fp) {
}

int mpc_ast_get_index(mpc_ast_t *ast, const char *tag) {
return mpc_ast_get_index_lb(ast, tag, 0);
return mpc_ast_get_index_lb(ast, tag, 0);
}

int mpc_ast_get_index_lb(mpc_ast_t *ast, const char *tag, int lb) {
int i;
int i;

for(i=lb; i<ast->children_num; i++) {
if(strcmp(ast->children[i]->tag, tag) == 0) {
return i;
}
for(i=lb; i<ast->children_num; i++) {
if(strcmp(ast->children[i]->tag, tag) == 0) {
return i;
}
}

return -1;
return -1;
}

mpc_ast_t *mpc_ast_get_child(mpc_ast_t *ast, const char *tag) {
return mpc_ast_get_child_lb(ast, tag, 0);
return mpc_ast_get_child_lb(ast, tag, 0);
}

mpc_ast_t *mpc_ast_get_child_lb(mpc_ast_t *ast, const char *tag, int lb) {
int i;
int i;

for(i=lb; i<ast->children_num; i++) {
if(strcmp(ast->children[i]->tag, tag) == 0) {
return ast->children[i];
}
for(i=lb; i<ast->children_num; i++) {
if(strcmp(ast->children[i]->tag, tag) == 0) {
return ast->children[i];
}
}

return NULL;
return NULL;
}

mpc_val_t *mpcf_fold_ast(int n, mpc_val_t **xs) {
Expand Down

0 comments on commit aa17e07

Please sign in to comment.