Processing potentially invalid URI and IRI References

Glossary

The identifier is a name for the issue (and is unique within this document).

The type of issue is one of:

Editorial: for example typographical errors, poor clarity, or inconsistent terminology.
Change: an addition, deletion, or modification to the published specification.

The status of the issue is one of:

Open: subject to ongoing discussion and not yet resolved.
Closed: resolved by the working group. Requires documented resolution.
Editor: an editorial issue has been resolved unilaterally. Can be re-opened by the working group.

The reference is an indication of where the issue was first raised.

The description is a succinct overview of the issue.

The resolution describes the specification change that resolves the issue.

Identifier	Type / Status	Reference and Description	Proposed Resolution / Latest Change
combine-valid	change open	Reference: <http://lists.w3.org/Archives/Public/public-iri/2011Jul/0014.html> derhoermi@gmx.net, 2011-07-03: In section 3.2 you have "The result will be a valid URI Reference if and only if the components used by the algorithm were valid themselves." I have some doubts about "only if", consider for instance removing dot segments, which might remove a malformed part, if I recall correctly.	latest change in revision latest
edit	edit open	julian.reschke@greenbytes.de, 2011-07-02: Umbrella issue for editorial fixes/enhancements.	latest change in revision latest
iri	change open	julian.reschke@greenbytes.de, 2011-07-02: Expand for IRIs.	latest change in revision latest

Identifier	Type / Status	Reference and Description	Resolution / Latest Change
post	change proc	julian.reschke@greenbytes.de, 2011-07-02: Define post-processing steps, such as query component rewriting based on document encoding.	latest change in revision latest
pre	change proc	julian.reschke@greenbytes.de, 2011-07-02: Define pre-processing steps for extraction of candidate references from content (WS stripping)?	latest change in revision latest
proc	change proc	julian.reschke@greenbytes.de, 2011-07-02: Re-state the parsing algorithm as a procedural algorithm, maybe in JS? derhoermi@gmx.net, 2011-07-03: We can turn the regular expression into a concise ABNF grammar if that helps, we might also adapt it if that is found to be necessary, but I do not see a reason why hundreds of lines of prose code or JavaScript code would help (and anyone who would like to have that anyway can easily de- rive it from the expression or from a grammar).	latest change in revision latest

Version	Issues
latest	\|\|\|\|\|\|
00	\|\|\|\|\|

Last change: 2011-07-03