Symbolic means that characters are given by predicates instead of concrete symbols and extended means that intersection and complement are supported in regexes. We consider a new match generation algorithm that is based on derivatives of symbolic regexes. The algorithm has been implemented as a tool SRM within the open source Microsoft Automata framework and uses the .NET regex parser as a frontend. We also discuss other uses and work in progress involving analysis with symbolic regexes.