Created
December 15, 2015 08:55
-
-
Save jooyunghan/b6555bea818532382129 to your computer and use it in GitHub Desktop.
Tree Parsing with Peg.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
var PEG = require('pegjs'); | |
var parser = PEG.buildParser(` | |
tree = fork? | |
fork = name:[a-z] c:children? { return Object.assign({name}, c); } | |
children = '(' left:tree ',' right:tree ')' {return {left,right}} | |
`); | |
var tree = parser.parse('a(b,c(,d))'); | |
console.log(tree); | |
function treeToString(tree) { | |
if (tree) { | |
if (tree.left || tree.right) | |
return tree.name + '(' + treeToString(tree.left) + ',' + treeToString(tree.right) + ')' | |
else | |
return tree.name; | |
} else { | |
return ""; | |
} | |
} | |
console.log(treeToString(tree)); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
https://wiki.haskell.org/99_questions/61_to_69#Problem_67A