query: Java Chess Game Regex
positive_passages.docid: 1388
positive_passages.text: Learning Regular Expressions
negative_passages.docid: 127684
negative_passages.text: How can I match a whole word in JavaScript?
negative_passages.docid: 41380
negative_passages.text: How to check if a given Regex is valid?
negative_passages.docid: 124258
negative_passages.text: How do you match one of two words in a regular expression?
negative_passages.docid: 101140
negative_passages.text: How can I find all matches to a regular expression in Python?
negative_passages.docid: 157596
negative_passages.text: Recursive matching with regular expressions in Javascript
negative_passages.docid: 148597
negative_passages.text: What is the term for a stalemate in Checkers?
negative_passages.docid: 97671
negative_passages.text: C++11 Regex Matching
negative_passages.docid: 86691
negative_passages.text: Regex for getting information from square brackets
negative_passages.docid: 41453
negative_passages.text: A Regex to match a SHA1
negative_passages.docid: 47106
negative_passages.text: How to match all occurrences of a regex
negative_passages.docid: 49341
negative_passages.text: JavaScript Regex, where to use escape characters?
negative_passages.docid: 53523
negative_passages.text: How to use regex in string in java?
negative_passages.docid: 62998
negative_passages.text: How to match multiple copies of a value?
negative_passages.docid: 69620
negative_passages.text: Need to find the recurrence equation for coloring a 1 by n chessboard
negative_passages.docid: 60179
negative_passages.text: JavaScript regular expression with global match help needed
negative_passages.docid: 32036
negative_passages.text: Regex.Match whole words