-
Notifications
You must be signed in to change notification settings - Fork 43
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Compl could work with non single-character length regexp #98
Comments
@EmileRolley, can you explain the semantic of such construct ? |
I need this also. Not aware of how sedlex is implemented, but haven't found a good way to represent Compl with a secession of chars. The exact code I have is a lexer to represent a printf-similar syntax but instead of The regexpes are defined like this:
I would like to define Since currently, as soon as there's one |
Can you write what you want with |
Totally, but I'm not entirely sure If you can make this structure work since combining Compl '$' with '$' generates a non-matchable rule, right? |
Yes, that's what I ended up doing and it would be convenient to have the possibility to simply write |
This doesn't seem to be the way you are supposed to write a tokenizer in general, or really what regular expressions are for as such... |
What is the way ? |
I don't know what your whole language is, but the reasonable thing to do is to write a grammar for it and to tokenize lexemes that you see rather than trying to not tokenize lexemes you don't see. |
Hello, I would like to know if there would be any reticence to add the possibility to use
Compl
with a non single-character length regexp ?The text was updated successfully, but these errors were encountered: