duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
| // Usage: | |
| // Copy and paste all of this into a debug console window of the "Who is Hiring?" comment thread | |
| // then use as follows: | |
| // | |
| // query(term | [term, term, ...], term | [term, term, ...], ...) | |
| // | |
| // When arguments are in an array then that means an "or" and when they are seperate that means "and" | |
| // | |
| // Term is of the format: | |
| // ((-)text/RegExp) ( '-' means negation ) |
| #include <iostream> | |
| #include <boost/asio.hpp> | |
| namespace asio = boost::asio; | |
| int main() { | |
| asio::io_service io_service; | |
| asio::ip::tcp::socket socket(io_service); | |
| socket.connect( asio::ip::tcp::endpoint( asio::ip::address::from_string("127.0.0.1"), 31400 ) ); |
| :- use_module(library(chr)). | |
| %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% | |
| % This program performs conversions from | |
| % regex -> NFA -> DFA | |
| % | |
| % It consists of three parts: | |
| % 1. A regular expression parser (DCG) | |
| % 2. A CHR program for converting DCG parse tree to an NFA | |
| % 3. A CHR program for converting the NFA to a DFA |