def parse_primers(self, primers=None, mismatches=<NUM_LIT:0>, revcompl=False):
<EOL>if primers is None: primers = self.primers<EOL>if not revcompl:<EOL><INDENT>fwd_regex = regex.compile("<STR_LIT>" % (primers.fwd_pattern, mismatches))<EOL>rev_regex = regex.compile("<STR_LIT>" % (primers.rev_pattern, mismatches))<EOL>generator = (ReadWithPrimers(r, fwd_regex, rev_regex) for r in self.parse())<EOL><DEDENT>if revcompl:<EOL><INDENT>fwd_regex = regex.compile("<STR_LIT>" % (primers.fwd_pattern,          mismatches))<EOL>rev_regex = regex.compile("<STR_LIT>" % (primers.rev_pattern_revcompl, mismatches))<EOL>generator = (ReadWithPrimersRevCompl(r, fwd_regex, rev_regex) for r in self.parse())<EOL><DEDENT>return GenWithLength(generator, len(self))<EOL>
This functions starts with self because it's 
    meant as an extension to the FASTA class.