Comments (2)
Ignoring NonTerminals
it could look like this:
match :: Prod r e t a -> Prod r e t ([t], a)
match = \case
Pure a -> Pure ([], a)
Terminal p c ->
Terminal (\t -> (t, ) <$> p t) (biliftA2 (flip (:)) id <$> match c)
-- NonTerminal :: !(r e t a) -> !(Prod r e t (a -> b)) -> Prod r e t b
NonTerminal _ _ -> error "match: NonTerminal"
Alts as c ->
-- Alts (match <$> as) (((\(ts, f) (t, x) -> (t ++ ts, f x))) <$> match c)
Alts (match <$> as) (biliftA2 (flip (++)) id <$> match c)
Many a c -> Many
(match a)
((\(t, f) (unzip -> (ts, xs)) -> (concat (ts ++ [t]), f xs)) <$> match c)
Named p n -> Named (match p) n
Edit: corrected implementation
from earley.
That sounds like a useful feature. A PR would be welcome.
An alternative approach might be to add a primitive
position :: Prod r e t Int
which always succeeds, giving you the current position in the input string.
You could then get the position before and after a production and use that to get the parsed slice of the input string.
from earley.
Related Issues (20)
- Q: How to do error recovery? HOT 1
- Wrong(?) result on some grammars with infinite results HOT 10
- Is Earley’s implementation related to Marpa? HOT 3
- Add a `eof` terminal HOT 5
- Behavior of Semigroup/Monoid instances for Prod? HOT 5
- Generate ABNF/EBNF from Earley grammar HOT 1
- Suggestion: Make it so that `<$` rules return at most one result. HOT 3
- Parsing into a list delimited by a token HOT 5
- INDENT and DEDENT HOT 5
- feature: constraint validation of production parse result HOT 7
- Please add tags "test ambiguity" etc HOT 2
- Crashes if grammar is infinitely ambiguous on given input HOT 11
- Is it okey to use "many" and heavily use Applicative parsing techniques? HOT 2
- Diverges with sepEndBy from parser-combinator HOT 1
- Report doesn't include enough information HOT 2
- Is there any possible optimization for getting non-exhaustive outputs for ambiguous grammars HOT 1
- Disambiguate/Filter productions HOT 1
- Missing case for Constraint for fmap and <*> HOT 3
- Something like Ruby Slippers parsing HOT 1
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from earley.