|
| 1 | +import fc from 'fast-check' |
| 2 | +import * as AST from '../src/ast' |
| 3 | +import * as CharSet from '../src/char-set' |
| 4 | +import { checkedAllCases } from 'src/utils' |
| 5 | + |
| 6 | +export function charSet(): fc.Arbitrary<CharSet.CharSet> { |
| 7 | + return fc.constantFrom('a', 'b', 'c', 'd', 'e', 'f') |
| 8 | + .map(CharSet.singleton) |
| 9 | +} |
| 10 | + |
| 11 | +export function repeatBounds(): fc.Arbitrary<AST.RepeatBounds> { |
| 12 | + return fc.oneof( |
| 13 | + fc.nat({ max: 10 }), |
| 14 | + fc.record({ min: fc.nat({ max: 10 }) }), |
| 15 | + fc.record({ max: fc.nat({ max: 10 }) }), |
| 16 | + fc.record({ min: fc.nat({ max: 5 }), max: fc.integer({ min: 5, max: 10 }) }) |
| 17 | + ) |
| 18 | +} |
| 19 | + |
| 20 | +export function captureName(): fc.Arbitrary<string | undefined> { |
| 21 | + return fc.option(fc.stringMatching(/^[a-zA-Z_]\w{0,8}$/)) |
| 22 | +} |
| 23 | + |
| 24 | +function epsilon(): fc.Arbitrary<AST.RegExpAST> { |
| 25 | + return fc.constant(AST.epsilon) |
| 26 | +} |
| 27 | + |
| 28 | +function literal(): fc.Arbitrary<AST.RegExpAST> { |
| 29 | + return charSet().map(AST.literal) |
| 30 | +} |
| 31 | + |
| 32 | +function concat(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 33 | + return fc.tuple(childArb(), childArb()) |
| 34 | + .map(([left, right]) => AST.concat(left, right)) |
| 35 | +} |
| 36 | + |
| 37 | +function union(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 38 | + return fc.tuple(childArb(), childArb()) |
| 39 | + .map(([left, right]) => AST.union(left, right)) |
| 40 | +} |
| 41 | + |
| 42 | +function star(innerArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 43 | + return innerArb().map(AST.star) |
| 44 | +} |
| 45 | + |
| 46 | +function plus(innerArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 47 | + return innerArb().map(AST.plus) |
| 48 | +} |
| 49 | + |
| 50 | +function optional(innerArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 51 | + return innerArb().map(AST.optional) |
| 52 | +} |
| 53 | + |
| 54 | +function repeat(innerArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 55 | + return fc.tuple(innerArb(), repeatBounds()) |
| 56 | + .map(([inner, bounds]) => AST.repeat(inner, bounds)) |
| 57 | +} |
| 58 | + |
| 59 | +function captureGroup(innerArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 60 | + return fc.tuple(innerArb(), captureName()) |
| 61 | + .map(([inner, name]) => AST.captureGroup(inner, name)) |
| 62 | +} |
| 63 | + |
| 64 | +function positiveLookahead(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 65 | + return fc.tuple(childArb(), childArb()) |
| 66 | + .map(([inner, right]) => AST.positiveLookahead(inner, right)) |
| 67 | +} |
| 68 | + |
| 69 | +function negativeLookahead(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 70 | + return fc.tuple(childArb(), childArb()) |
| 71 | + .map(([inner, right]) => AST.negativeLookahead(inner, right)) |
| 72 | +} |
| 73 | + |
| 74 | +function startMarker(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 75 | + return fc.tuple(childArb(), childArb()) |
| 76 | + .map(([left, right]) => AST.startMarker(left, right)) |
| 77 | +} |
| 78 | + |
| 79 | +function endMarker(childArb: () => fc.Arbitrary<AST.RegExpAST>): fc.Arbitrary<AST.RegExpAST> { |
| 80 | + return fc.tuple(childArb(), childArb()) |
| 81 | + .map(([left, right]) => AST.endMarker(left, right)) |
| 82 | +} |
| 83 | + |
| 84 | +/** |
| 85 | + * Traverses AST and renames capturing groups if the name already occurs in the expression. |
| 86 | + * `new RegExp(...)` throws an error when capture group names occur multiple times in the |
| 87 | + * same expression. |
| 88 | + */ |
| 89 | +export function makeCaptureGroupNamesUnique(ast: AST.RegExpAST): AST.RegExpAST { |
| 90 | + const seenNames = new Map<string, number>() |
| 91 | + |
| 92 | + function renameIfSeen(name: string) { |
| 93 | + const counter = seenNames.get(name) |
| 94 | + if (counter === undefined) { |
| 95 | + seenNames.set(name, 1) |
| 96 | + return name |
| 97 | + } else { |
| 98 | + const newName = `${name}_${counter+1}` |
| 99 | + return renameIfSeen(newName) |
| 100 | + } |
| 101 | + } |
| 102 | + |
| 103 | + function traverse(node: AST.RegExpAST): AST.RegExpAST { |
| 104 | + switch (node.type) { |
| 105 | + case 'epsilon': |
| 106 | + return node |
| 107 | + case 'literal': |
| 108 | + return node |
| 109 | + case 'concat': |
| 110 | + return AST.concat(traverse(node.left), traverse(node.right)) |
| 111 | + case 'union': |
| 112 | + return AST.union(traverse(node.left), traverse(node.right)) |
| 113 | + case 'star': |
| 114 | + return AST.star(traverse(node.inner)) |
| 115 | + case 'plus': |
| 116 | + return AST.plus(traverse(node.inner)) |
| 117 | + case 'optional': |
| 118 | + return AST.optional(traverse(node.inner)) |
| 119 | + case 'repeat': |
| 120 | + return AST.repeat(traverse(node.inner), node.bounds) |
| 121 | + case 'capture-group': { |
| 122 | + const innerProcessed = traverse(node.inner) |
| 123 | + |
| 124 | + if (node.name === undefined) { |
| 125 | + return AST.captureGroup(innerProcessed, node.name) |
| 126 | + } else { |
| 127 | + const nameProcessed = renameIfSeen(node.name) |
| 128 | + return AST.captureGroup(innerProcessed, nameProcessed) |
| 129 | + } |
| 130 | + } |
| 131 | + case 'positive-lookahead': |
| 132 | + return AST.positiveLookahead(traverse(node.inner), traverse(node.right)) |
| 133 | + case 'negative-lookahead': |
| 134 | + return AST.negativeLookahead(traverse(node.inner), traverse(node.right)) |
| 135 | + case 'start-marker': |
| 136 | + return AST.startMarker(traverse(node.left), traverse(node.right)) |
| 137 | + case 'end-marker': |
| 138 | + return AST.endMarker(traverse(node.left), traverse(node.right)) |
| 139 | + default: |
| 140 | + checkedAllCases(node) |
| 141 | + } |
| 142 | + } |
| 143 | + |
| 144 | + return traverse(ast) |
| 145 | +} |
| 146 | + |
| 147 | +export function regexpAST(size = 20): fc.Arbitrary<AST.RegExpAST> { |
| 148 | + return regexpAST_(size).map(makeCaptureGroupNamesUnique) |
| 149 | +} |
| 150 | +function regexpAST_(size: number): fc.Arbitrary<AST.RegExpAST> { |
| 151 | + if (size <= 1) { |
| 152 | + return fc.oneof( |
| 153 | + epsilon(), |
| 154 | + literal() |
| 155 | + ) |
| 156 | + } else { |
| 157 | + const childSize = Math.floor(size / 2) |
| 158 | + return fc.oneof( |
| 159 | + { arbitrary: epsilon(), weight: 1 }, |
| 160 | + { arbitrary: literal(), weight: 5 }, |
| 161 | + { arbitrary: concat(() => regexpAST_(childSize)), weight: 3 }, |
| 162 | + { arbitrary: union(() => regexpAST_(childSize)), weight: 3 }, |
| 163 | + { arbitrary: star(() => regexpAST_(childSize)), weight: 1 }, |
| 164 | + { arbitrary: plus(() => regexpAST_(childSize)), weight: 1 }, |
| 165 | + { arbitrary: optional(() => regexpAST_(childSize)), weight: 1 }, |
| 166 | + { arbitrary: repeat(() => regexpAST_(childSize)), weight: 1 }, |
| 167 | + { arbitrary: captureGroup(() => regexpAST_(childSize)), weight: 2 }, |
| 168 | + { arbitrary: positiveLookahead(() => regexpAST_(childSize)), weight: 1 }, |
| 169 | + { arbitrary: negativeLookahead(() => regexpAST_(childSize)), weight: 1 }, |
| 170 | + { arbitrary: startMarker(() => regexpAST_(childSize)), weight: 1 }, |
| 171 | + { arbitrary: endMarker(() => regexpAST_(childSize)), weight: 1 } |
| 172 | + ) |
| 173 | + } |
| 174 | +} |
| 175 | + |
| 176 | +export function regexp(size?: number): fc.Arbitrary<RegExp> { |
| 177 | + return regexpAST(size).map(ast => new RegExp(AST.toString(ast, { useNonCapturingGroups: true }))) |
| 178 | +} |
0 commit comments