Interpret Repetition! This challenge is the first in a two-challenge series about Repetition. The second will be up soon.
In a language called Repetition (something I just made up), there consists an infinite string of 12345678901234567890..., with 1234567890 repeating forever.
The following syntax is available to output numbers:

+-*/: This inserts the operator into the string of repeating digits.

Examples:

+ -&gt; 1+2 = 3 (The + inserts a + between 1 and 2)
+* -&gt; 1+2*3 = 1+6 = 7 (Same as above, except two operators are used now)
/ -&gt; 1/2 = 0 (Repetition uses integer division)
// -&gt; 1/2/3 = 0/3 = 0 (Repetition uses &quot;left association&quot; with multiple subtractions and divisions)


Each operator is inserted so that it has one digit to its left, unless there are c's (see below).


c: Concatenates with the next digit in the string.

Examples:

c+ -&gt; 12+3 = 15 (The c &quot;continues&quot; the 1 and concatenates it with the next digit, 2, to form 12)
+c -&gt; 1+23 = 24
ccc -&gt; 1234




(): Brackets for processing numbers.

Examples:

(c+)* -&gt; (12+3)*4 = 15*4 = 60 (Repetition uses the order of operations)
(c+)/c -&gt; (12+3)/45 = 15/45 = 0
(cc+c)/ -&gt; (123+45)/6 = 168/6 = 28




s: Skip a number (removes the number from the infinite string).

s+ -&gt; 2+3 = 5 (s skips 1)
csc -&gt; 124 (The first c concats 1 and 2, the s skips 3, and the final c concats 12 to 4)
+s+ -&gt; 7 (The first + adds 1 and 2 to make 3, s skips 3, and the final + adds 3 to 4 to make 7)
cs*(++) -&gt; 12*(4+5+6) = 12*15 = 180



In the examples above, only a finite amount of digits in the infinite string are used. The number of digits used is equivalent to number of operators, concats and skips + 1.
Your task is, when given a string of Repetition code, output the result.
Examples of input and output are:
++ -&gt; 6
- -&gt; -1
(-)* -&gt; -3
cscc -&gt; 1245
(cc+c)/ -&gt; 28
cc+c/ -&gt; 130
cs*(++) -&gt; 180

This is code golf, so shortest code in bytes wins!
Specs:

You are guaranteed that the result will never go above 2^31-1.
You are also guaranteed that the input will only consist of the symbols +-*/cs().
An empty program will output 1.
JavaScript (ES6), 110 bytes

s=&gt;eval((" "+s)[R='replace'](/[^\)](?!\()/g,x=&gt;x+i++%10,i=1)[R](/c| (\ds)+|s\d/g,"")[R](/\d+\/\d+/g,"($&amp;|0)"))


Very simple, but integer division adds 25 bytes. For some reason a regex in JS can't match both the beginning of a string and the first character, so that adds a few bytes as well.

How it works


Prepend a space to the input.
Append the next digit to each character (except )) that isn't immediately before a (.
Remove each c, a digit + s at the beginning (1s2 -> 2), and each s + a digit (3s4 -> 3).
Turn each division operation into int-division (1/2 -> (1/2|0)).
Evaluate and return.