reference: refactor grammar and regular expressions
To resolve some inconsistencies between the grammar and the regular expressions, the grammar has been slightly refactored to match the intent. The regular expressions have been redefined with the same structure to make it easier to verify the grammar is correct. Signed-off-by: Stephen J Day <stephen.day@docker.com>
This commit is contained in:
parent
568bf038af
commit
3150937b9f
3 changed files with 115 additions and 36 deletions
|
@ -119,6 +119,11 @@ func TestHostRegexp(t *testing.T) {
|
|||
}
|
||||
|
||||
func TestFullNameRegexp(t *testing.T) {
|
||||
if anchoredNameRegexp.NumSubexp() != 2 {
|
||||
t.Fatalf("anchored name regexp should have two submatches: %v, %v != 2",
|
||||
anchoredNameRegexp, anchoredNameRegexp.NumSubexp())
|
||||
}
|
||||
|
||||
testcases := []regexpMatch{
|
||||
{
|
||||
input: "",
|
||||
|
@ -401,6 +406,11 @@ func TestFullNameRegexp(t *testing.T) {
|
|||
}
|
||||
|
||||
func TestReferenceRegexp(t *testing.T) {
|
||||
if ReferenceRegexp.NumSubexp() != 3 {
|
||||
t.Fatalf("anchored name regexp should have three submatches: %v, %v != 3",
|
||||
ReferenceRegexp, ReferenceRegexp.NumSubexp())
|
||||
}
|
||||
|
||||
testcases := []regexpMatch{
|
||||
{
|
||||
input: "registry.com:8080/myapp:tag",
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue