theoinf 0.2.0

Parsers and interpreters for theoretical computer science topics.
Documentation
  • Coverage
  • 40.51%
    32 out of 79 items documented0 out of 42 items with examples
  • Size
  • Source code size: 68.85 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 5.38 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 33s Average build duration of successful builds.
  • all releases: 27s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Repository
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • dawedawe

theoinf

A crate for various topics from theoretical computer science.
Currently, there are parsers and interpreters for the following topics:

  • set theory
  • propositional logic
  • deterministic finite automata

More will follow.

set theory

All the usual operations of naive set theory are implemented.

propositional logic

All the usual operations of propositional logic are implemented.
The result struct contains the truth table and more information about the formula.

deterministic finite automata

A DFA can be defined and words can be tested for acceptance.