6
Task
Write a program/function that, given three integers n,a,b prints a regular expression which matches all of the base-n
integers from a
to b
(and no integers outside of that range).
Your algorithm should, in theory, work for arbitrarily large integers. In practice, you may assume that the input can be stored in your data type. (don't abuse native data type, that's a standard loophole)
Input
Three integers, n, a, b
where n
is in the range 1-32. a
and b
may be taken as base-n
string/character list/digit list.
Output
A single string, represent the regex.
Rules
- Base-n integers use the first
n
digits of0123456789ABCDEFGHIJKLMNOPQRSTUV
, you can choose to use upper-case or lower-case. a
andb
may be negative, denoted by a-
in front of the integer- You may assume
a ≤ b
. - Any regex flavor is allowed.
- The behavior of the regex on strings not a base-n integer is undefined.
Winning criteria
Answers will be scored by the length of the code in bytes. (so code-golf rules apply)
Should we be able to match integers inside other text, or are we guaranteed they will be on their own? – Erik the Outgolfer – 2017-12-18T16:49:23.533
Also, should we be able to match negative integers too? If so, how will the sign be represented? – Erik the Outgolfer – 2017-12-18T16:51:43.730
Yes it should be able to match negative integers. Looks like that got edited out of the question. – Josh Withee – 2017-12-18T17:06:44.533
You can assume the integer will be on its own – Josh Withee – 2017-12-18T17:07:27.137
So, are negative integers represented with a
-
in the front or something else? – Erik the Outgolfer – 2017-12-18T17:10:00.760@EriktheOutgolfer question updated – Josh Withee – 2017-12-18T19:12:00.157