Open erroronline1 opened 3 years ago
OK, so, to be clear, my choice of phrase "universal parser" is a bit of a simplification. What I really have in mind is we classify all the languages into a taxonomy and draw up a tree diagram to represent this structure. That structure will inform us what the Gallifreyan parser class inheritance tree should look like.
i thought i got that 😅. still can't figure out a scheme that describes each scribes splitting- and grouping-pattern and can be passed to the parser to be regularly processed. i'd be delighted to see a solution!
ModisR's idea of a universal parser for all scribes. if i am not mistaken these are common rules:
however i do not know how to adress following differences by myself:
if anyone comes up with a clever solution of universal appliance that does not include a bunch of if-queries for every scribe that'd be great. otherwise the current module-specific input parsing seems to make more sense imho.