{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.0","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.0","dist":{"shasum":"436723afbb9607863c1cc344e6dd89d4f0bb0a98","size":31137,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.0.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1380815454338,"_hasShrinkwrap":false,"_cnpm_publish_time":1380815454338,"dist-tags":{"latest":"0.1.4"}}