Kivach
Cascading donations
Add repoPopularDonorsF.A.Q.
My repos

Footer

Subscribe to our newsletter

The latest news, articles, and resources, sent to your inbox.

DiscordTelegramTwitterMediumFacebookYouTubeGitHub

All information about repositories belongs to their owners.

More information about Kivach in the introductory article.

Built on Obyte

Total donated
Undistributed
Share with your subscribers:

Recipients

How the donated funds are distributed

Support the dependencies

Support the repos that depend on this repository

Top contributors

Recent events

Kivach works on the Obyte network, and therefore you can track all donations.

No events yet
fmfi-uk-1-ain-412

fmfi-uk-1-ain-412/js-fol-parser

A suite of JavaScript parsers for first-order logic languages.

JavaScript
1
4
MIT License
crnkjck's profile
crnkjck
75 contributions
nikolakulikova's profile
nikolakulikova
17 contributions
alenkakli's profile
alenkakli
3 contributions
KillerShady's profile
KillerShady
3 contributions
dependabot[bot]'s profile
dependabot[bot]
3 contributions

Support the dependencies of fmfi-uk-1-ain-412/js-fol-parser

Account's avatar
babel/babel
babel's modular runtime helpers
Account's avatar
babel/babel
Babel command line.
Account's avatar
babel/babel
Babel compiler core.
Account's avatar
babel/babel
A Babel preset for each environment.
Account's avatar
babel/babel
Babel preset for TypeScript.
Account's avatar
moxystudio/node-cross-spawn
Cross platform child_process#spawn and child_process#spawnSync
Account's avatar
meza/jest-chance
Random seed generator for chancejs with jest
Account's avatar
kentcdodds/kcd-scripts
CLI for common scripts for my projects
Account's avatar
peggyjs/peggy
Parser generator for JavaScript
Account's avatar
microsoft/TypeScript
TypeScript is a language for application scale JavaScript development
Account's avatar
vitejs/vite
Native-ESM powered web dev build tool

The **js‑fol‑parser** library provides a collection of pure‑JavaScript parsers for first‑order logic syntax: terms, formulas (with strict or precedence‑based grammars), clauses, substitutions, and finite‑structure definitions. It is aimed at developers building theorem‑provers, model checkers, or educational tools who need to turn textual FOL expressions into custom AST nodes or other representations via user‑supplied factory functions.