polsevev/mtgsearch
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
A DSL powered search engine for magic the gathering cards
8 commits 1 branch 0 tags 499 KiB
Haskell 98.7%
HTML 1.3%
Find a file
polsevev 5c4069ad49 need to clear IO somehow, possibly done by performing the bottom queries by themselves, then performing the operators on the pure lists
2023-04-29 21:36:42 +02:00
app need to clear IO somehow, possibly done by performing the bottom queries by themselves, then performing the operators on the pure lists 2023-04-29 21:36:42 +02:00
Config Finished a dumb lexer 2023-04-28 21:08:56 +02:00
src need to clear IO somehow, possibly done by performing the bottom queries by themselves, then performing the operators on the pure lists 2023-04-29 21:36:42 +02:00
test initial commit 2023-03-16 15:54:10 +01:00
.gitignore changed gitignore 2023-03-16 15:56:55 +01:00
CHANGELOG.md initial commit 2023-03-16 15:54:10 +01:00
LICENSE initial commit 2023-03-16 15:54:10 +01:00
mtgsearch.cabal need to clear IO somehow, possibly done by performing the bottom queries by themselves, then performing the operators on the pure lists 2023-04-29 21:36:42 +02:00
package.yaml Initial simple search has been implemented 2023-04-11 16:39:44 +02:00
README.md Cleaned input and removed bracket around entire statement 2023-04-28 21:39:04 +02:00
Setup.hs initial commit 2023-03-16 15:54:10 +01:00
stack.yaml initial commit 2023-03-16 15:54:10 +01:00
stack.yaml.lock initial commit 2023-03-16 15:54:10 +01:00

README.md

mtgsearch

Developement of a custom magic card search engine.

DSL

Will be a language based in set theory, where queries can be combined, negated etc etc. Example.

Lexer

This languages lexer is very dumb. Therefore you the user has to be very verbose with your parenthesis. Example:

This will not work:

(IS Instant) union (Color Red) union (Color Green)

However this will

((IS Instant) union (Color Red)) union (Color Green)