arjun-krishna / regex Goto Github PK
View Code? Open in Web Editor NEWA good C++ implementation of CYK algorithm for a generic CNF grammer and also parsing RegExp
A good C++ implementation of CYK algorithm for a generic CNF grammer and also parsing RegExp
#### README #### _______________________________________________________________________________ author : Arjun Krishna _______________________________________________________________________________ # the following looks good when viewed from the vi editor # _______________________________________________________________________________ file_structure: a) main.cpp : Main code compiled as match (executable) b) grammer.cnf : Grammer which generates valid regular expressions c) cnf.h : Library for converting a cnf grammer containing file i.e grammer.cnf ( which is required in a described format ) d) regex.h : Library for constructing an NFA for a regular expression and for matching strings (i.e to check if string belongs to the language represented by the regular expression. _______________________________________________________________________________ FORMAT FOR GRAMMER ( for grammer.cnf ): ____________________________________________________________________________ | FORMAT | | | |<A>=<B><C> | |<A>=$a$ | |____________________________________________________________________________| meaning, grammer has productions A -> BC A -> a <B> -- indicates non terminal symbol $B$ -- indicates a terminal symbol _______________________________________________________________________________ cnf.h: class CNF: constructor : CNF(file_name) # file_name contains the grammer in CNF functions: 1) print_productions() # prints the productions in the grammer 2) CYK(s) # run the CYK algorithm on string s # returns 1 if s is in language of the Grammer _______________________________________________________________________________ regex.h: class automaton: public variables: vector <int> S # Start states vector <int> F # Final states adj # The di-graph representation of automaton Q # The number of states in automaton constructor: automaton(char a) # automaton that accepts only string a functions: {Not part of the class} nfa_union(A,B) # return NFA of union of A and B dot(A,B) # return NFA of concatenation of A and B astrix(A) # return NFA of A* create_automaton(regex) # returns automaton that accepts L(regex) run_NFA(M,s) # run's the string s on NFA M match_string(M,s) # returns 1 if s is accepted by 1 else 0 _______________________________________________________________________________ main.cpp : # code when compiled requires input of the format N is a integer |regex| <= 100 |string| <= 100000 input: regex N {followed by N strings to be tested} output: { Yes/No N times } # Yes if the string is accepted by L(regex) # No otherwise _______________________________________________________________________________ --------------------------------- END -----------------------------------------
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.