parseur récursif de descente

Traductions

• anglais

  Auteur : Office québécois de la langue française, 1997

  Note :

  A recursive descent parser operates top-to-bottom, left-to- right on a context-free grammar. That is, parsing proceeds by matching against the first rule with 'S' on the left-hand side and concentrating on the first symbol on the right hand side. If this is a non-terminal symbol the process proceeds by finding the first rule to match this symbol. If it is a terminal, then it tries to match that symbol against the input. It therefore represents a depth-first search of the problem-space created by the grammar, and can loop indefinitely in the case of left-recursion in the grammar rules.

  Terme :

  1. recursive descent parser