- From: Alwin Blok <notifications@github.com>
- Date: Thu, 01 Sep 2022 11:16:23 -0700
- To: whatwg/url <url@noreply.github.com>
- Cc: Subscribed <subscribed@noreply.github.com>
Received on Thursday, 1 September 2022 18:16:36 UTC
Regarding this issue, there may be other options. First, I suspect that the people that are asking for a formal grammar, would be somewhat satisfied also with a short, concise, and easy to follow parsing algorithm; one that is separate from resolution and normalisation. It is also possible to specify the parser with a little bit of code that drives a DFA. Then you have a relatively small table and a bit of code that together define the parser. It is not bnf but it may be quite clear. I can try and show that, if it is not adopted then at least it may be fun. -- Reply to this email directly or view it on GitHub: https://github.com/whatwg/url/issues/479#issuecomment-1234625501 You are receiving this because you are subscribed to this thread. Message ID: <whatwg/url/issues/479/1234625501@github.com>
Received on Thursday, 1 September 2022 18:16:36 UTC