npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

dfa

v1.2.0

Published

A state machine compiler

Downloads

7,784,772

Readme

dfa

Compiles a regular expression like syntax to fast deterministic finite automata. Useful for pattern matching against non-string sequences.

Example

This example matches Hangul syllables. The symbols defined in the machine are Unicode character categories which could be mapped from code points.

Machine definition:

# define symbols
X   = 0; # Other character
L   = 1; # Leading consonant
V   = 2; # Medial vowel
T   = 3; # Trailing consonant
LV  = 4; # Composed <LV> syllable
LVT = 5; # Composed <LVT> syllable
M   = 6; # Tone mark

# define variables
decomposed = L V T?;
partial = LV T?;
composed = LVT;

# define main state machine pattern
main = (decomposed | partial | composed) M?;

Visualized, the machine looks like this (double circles are accepting states):

dfa

Compiling and using the machine:

import compile from 'dfa/compile';
import fs from 'fs';

let stateMachine = compile(fs.readFileSync('hangul.machine', 'utf8'));

// find matches
for (let [startIndex, endIndex] of stateMachine.match([0, 1, 2, 3, 0, 4, 6]) {
  console.log('match:', startIndex, endIndex);
}

Output:

match: 1 3
match: 5 6

Syntax

A state machine file contains a list of assignment statements. Comments are also allowed and are started with the # character. Each statement is an assignment of a variable name to a value or expression. Assigning a variable to a number produces a symbol, which is added to the state machine's alphabet. Assigning a variable to an expression allows for substitutions into later expressions. The special main variable should always be assigned to at the end of the file, and is the final expression that will be compiled.

A subset of common regular expression syntax is supported. A list of operators and their precedence is below. Operators with the same precedence are evaluated left to right.

| Precedence | Syntax | Type | Meaning | | ---------- | ---------- | --------------| ------------------------------------------ | | 1 | a \| b | Alternation | Matches either a or b | | 2 | a b | Concatenation | Matches a followed by b | | 3 | a* | Repetition | Matches zero or more occurrences of a | | 3 | a+ | Repetition | Matches one ore more occurrences of a | | 3 | a? | Optional | Matches zero or one occurrence of a | | 3 | a{n} | Repetition | Matches exactly n occurrences of a | | 3 | a{n,} | Repetition | Matches n or more occurrences of a | | 3 | a{,n} | Repetition | Matches up to n occurrences of a | | 3 | a{n,m} | Repetition | Matches n to m occurrences of a | | 4 | t:<expr> | Tag | Tags the following expression with tag t | | 5 | (<expr>) | Grouping | Groups an expression |

License

MIT