A “Parserless Parser” – My take on parsing inputs based on monotonic extension, Semantic Function, Traverseless Hypergraph, and Dynamic Resolution, that enables one to build a sort of universal parser where the “grammar” is the implementation, and which even potentially allows for the parsing of contextual grammars.
Depends on Bottom-Driven Semantic Monotonicity (an MVP already exists)
Depends on Semantic Function (an MVP already exists)
Depends on A “Traverseless Hypergraph” (an MVP already exists)
Depends on Dynamic Resolution (an MVP already exists)
Copied from Translation As A Transfer Of Semantic Authority