Bit-coded Regular Expression Parsing

@inproceedings{Nielsen2011BitcodedRE,
  title={Bit-coded Regular Expression Parsing},
  author={Lasse Nielsen and Fritz Henglein},
  booktitle={LATA},
  year={2011}
}
Regular expression parsing is the problem of producing a parse tree of a string for a given regular expression. We show that a compact bit representation of a parse tree can be produced efficiently, in time linear in the product of input string size and regular expression size, by simplifying the DFA-based parsing algorithm due to Dubé and Feeley to emit the bits of the bit representation without explicitly materializing the parse tree itself. We furthermore show that Frisch and Cardelli’s… CONTINUE READING
BETA

Similar Papers

Loading similar papers…