Remove DSLTree.Node.regexLiteral

This doesn't appear to be used.

Author: hamishknight

Sources/_StringProcessing/ByteCodeGen.swift

@@ -812,9 +812,6 @@ fileprivate extension Compiler.ByteCodeGen {
         }
       }
 
-    case let .regexLiteral(l):
-      return try emitNode(l.ast.dslTreeNode)
-
     case let .convertedRegexLiteral(n, _):
       return try emitNode(n)
 

Sources/_StringProcessing/ConsumerInterface.swift

@@ -29,10 +29,6 @@ extension DSLTree.Node {
       // TODO: Should we handle this here?
       return nil
 
-    case .regexLiteral:
-      fatalError(
-        "unreachable: We should only ask atoms")
-
     case let .convertedRegexLiteral(n, _):
       return try n.generateConsumer(opts)
 

Sources/_StringProcessing/PrintAsPattern.swift

@@ -258,9 +258,6 @@ extension PrettyPrinter {
     case let .quotedLiteral(v):
       print(v._quoted)
 
-    case .regexLiteral:
-      printBackoff(node)
-
     case let .convertedRegexLiteral(n, _):
       // FIXME: This recursion coordinates with back-off
       // check above, so it should work out. Need a

Sources/_StringProcessing/Regex/DSLTree.swift

@@ -71,9 +71,6 @@ extension DSLTree {
 
     case quotedLiteral(String)
 
-    /// An embedded literal.
-    case regexLiteral(_AST.ASTNode)
-
     // TODO: What should we do here?
     ///
     /// TODO: Consider splitting off expression functions, or have our own kind
@@ -343,7 +340,7 @@ extension DSLTree.Node {
 
     case let .conditional(_, t, f): return [t,f]
 
-    case .trivia, .empty, .quotedLiteral, .regexLiteral,
+    case .trivia, .empty, .quotedLiteral,
         .consumer, .matcher, .characterPredicate,
         .customCharacterClass, .atom:
       return []
@@ -357,7 +354,6 @@ extension DSLTree.Node {
 extension DSLTree.Node {
   var astNode: AST.Node? {
     switch self {
-    case let .regexLiteral(literal):             return literal.ast
     case let .convertedRegexLiteral(_, literal): return literal.ast
     default: return nil
     }
@@ -391,8 +387,6 @@ extension DSLTree.Node {
     switch self {
     case .capture:
       return true
-    case let .regexLiteral(re):
-      return re.ast.hasCapture
     case let .convertedRegexLiteral(n, re):
       assert(n.hasCapture == re.ast.hasCapture)
       return n.hasCapture
@@ -603,9 +597,6 @@ extension DSLTree.Node {
       }
       child._addCaptures(to: &list, optionalNesting: optNesting)
 
-    case let .regexLiteral(re):
-      return re.ast._addCaptures(to: &list, optionalNesting: nesting)
-
     case let .absentFunction(abs):
       switch abs.ast.kind {
       case .expression(_, _, let child):
@@ -634,7 +625,7 @@ extension DSLTree.Node {
       return true
     case .orderedChoice, .concatenation, .capture,
          .conditional, .quantification, .customCharacterClass, .atom,
-         .trivia, .empty, .quotedLiteral, .regexLiteral, .absentFunction,
+         .trivia, .empty, .quotedLiteral, .absentFunction,
          .convertedRegexLiteral, .consumer,
          .characterPredicate, .matcher:
       return false
@@ -693,7 +684,7 @@ extension DSLTree {
 
       case let .conditional(_, t, f): return [_Tree(t), _Tree(f)]
 
-      case .trivia, .empty, .quotedLiteral, .regexLiteral,
+      case .trivia, .empty, .quotedLiteral,
           .consumer, .matcher, .characterPredicate,
           .customCharacterClass, .atom:
         return []