Longest-match Rule

The Longest-Match Rule is a lexical disambiguation principle in lexical analysis that selects the longest possible lexeme matching a given input string over shorter competing matches, thereby determining the most appropriate token boundary in a scanner.

29

Publications

1.5K

Citations

75

Authors

34

Institutions

Publications per year

2017–2026

3

Authors

75

  1. BF
    Bryan Ford

    Yale University, United States

    3 publications · 288 citations

    3

    h-index

  2. YF
    Yu Fang

    University of California, Berkeley, United States

    2 publications · 169 citations

    2

    h-index

  3. DP
    Diego Perino

    Telefonica Research and Development, Spain

    2 publications · 106 citations

    2

    h-index

  4. RH
    Randy H. Katz

    University of California, Berkeley, United States

    2 publications · 169 citations

    2

    h-index

  5. MV
    Matteo Varvello

    Nokia (United States), United States

    2 publications · 106 citations

    2

    h-index

1–5 of 75

Venues

  1. IEEE Micro

    2 publications · 117 citations

    2

    h-index

  2. ArXiv.org

    Repository · 2 publications · 107 citations

    2

    h-index

  3. ACM SIGPLAN Notices

    1 publications · 33 citations

    1

    h-index

  4. IEEE/ACM Transactions on Networking

    TON · 1 publications · 46 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 29 citations

    1

    h-index

1–5