Simple text tree diagrams from arrays.
Generates simple text trees
hast utility to get the plain-text value of a node according to the `innerText` algorithm
A light-weight module that brings Fetch API to node.js
ECMAScript (ESTree) AST walker
Simple yet powerful framework for building command-line apps.
Fast Splay tree for Node and browser
mdast utility to get the plain text content of a node
Generate fallback values for content with alt text
A mature CSV toolset with simple api, full of options and tested against large datasets.
TypeScript definitions for html-to-text
Javascript markdown parsing, made simple
Simple XML builder for Node.js
Advanced html to plain text converter
Markdown-it - modern pluggable markdown parser.
hast utility to get the plain-text value of a node
This package contains plain text helpers for Lexical.
This package contains rich text helpers for Lexical.
hast utility to create an element from a simple CSS selector
Layout algorithms for visualizing hierarchical data.
Easy autofixable import sorting
Use text-decoration in it's shorthand form in CSS
Regular Expressions parser in JavaScript
TypeScript definitions for istanbul-reports
Build url menu trees in plain text with simple syntax.
Convert from a simple hierarchical-tree outline text into ugly xlsx file
Using this package, you can do powerful pattern recognition easily from your shell command line using a simple suite of tools. Applications include music cateogrization, text classification, handwritten digit recognition, and evolutionary tree reconstruction. The technique is based on a very general theoretical notion of Kolmogorov Complexity, and so is undoubtedly applicable to many as yet unknown disciplines. See the webpage for research papers explaining the math behind these techniques.
It starts from the arbitrary page you provide and descents into the tree of links until it has either traversed all possible content on the web site or has stopped at some predefined traversal depth. It is written in Ruby and implemented as a CLI application. Based on user preference, it can output text reports in a standard sitemap.xml form (used by many search engines), a dot file (for easier site hierarchy visualization, graphviz compatible), a plain text file (displaying detailed hierarchical relations between pages) and a simple HTML format.
Pegarus is, broadly, an implementation of LPEG on Rubinius. LPEG implements a Parsing Expression Grammar using a parsing machine rather than the Packrat algorithm. (See "A Text Pattern-Matching Tool based on Parsing Expression Grammars" by Roberto Ierusalimschy.) Pegarus actually implements an abstract syntax tree (AST) for the PEG. There are various options to execute the AST against a subject string. One option is a simple AST-walking evaluator. A second option is an implementation of the LPEG parsing machine. A third option is a compiler that targets Rubinius bytecode.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.