Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy

@article{Larsen1998RegularEW,
  title={Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy},
  author={Kim S. Larsen},
  journal={Inf. Process. Lett.},
  year={1998},
  volume={65},
  pages={169-172}
}
For many years, regular expressions with back referencing have been used in a variety of software products in common use, including operating systems, editors, and programming languages. In these products, regular expressions have been extended with a naming construct. If a subexpression is named by some variable, whenever this subexpression matches some string, that string is assigned to the variable. Later occurrences of the same variable will then match the string assigned to it. This… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Algorithms for Finding Patterns in Strings

  • Alfred V. Aho
  • Computer Science
  • Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990

Finding Patterns Common to a Set of Strings

  • Dana Angluin
  • Mathematics, Computer Science
  • J. Comput. Syst. Sci.
  • 1980