Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with regular-expressions
Search options not deleted
user 96044
Questions about regular expressions, a formalism to describe regular languages.
-2
votes
Regular expression for words where the same symbol can repeat at most two times consecutively?
How about this C++ code?
string loc;
char sent[] = {a, b};
for (int i=0; i<N; i++)
{
int pos = rand()%2;
if (i>=2)
{
if (loc[i-2]==loc[i-1])
{
if (sent[i-2] == loc[i …
- 101