TERMIUM Plus®

From: Translation Bureau

On social media

Consult the Government of Canada’s terminology data bank.

GRAMMAR RULE [9 records]

Record 1 2025-08-01

English

Subject field(s)
  • Computer Programs and Programming
CONT

The grammatical rules of an affix grammar are those of a context-free grammar, except that certain parts in the nonterminals(the affixes) are used as arguments. If the same affix occurs multiple times in a rule, its value must agree, i. e. it must be the same everywhere.

French

Domaine(s)
  • Programmes et programmation (Informatique)
CONT

Les règles d'une grammaire affixe ressemblent à celles de grammaires non-contextuelles, dont les noms-de-notion (ou non-terminaux) seraient paramétrés. Ces paramètres appelés affixes permettent de doter ces notions de modalités. Leur nom s'inspire de la linguistique, où des modalités peuvent régir les affixes (préfixes, infixes ou suffixes).

Spanish

Campo(s) temático(s)
  • Programas y programación (Informática)
DEF

Elemento dependiente de un nombre que se añade al principio (prefijo), en el medio (infijo) o al final (sufijo) de un nombre y que modifica su significado.

Save record 1

Record 2 2019-11-18

English

Subject field(s)
  • Computer Programs and Programming
DEF

[A] formal grammar [that] is used to describe the syntax of languages, mainly computer languages, using an approach based on how natural language is typically described.

CONT

The grammatical rules of an affix grammar are those of a context-free grammar, except that certain parts in the nonterminals(the affixes) are used as arguments. If the same affix occurs multiple times in a rule, its value must agree, i. e. it must be the same everywhere. In some types of affix grammar, more complex relationships between affix values are possible.

French

Domaine(s)
  • Programmes et programmation (Informatique)
DEF

[...] grammaire formelle utilisée pour décrire la syntaxe de langages, inspirée de la description des langues naturelles.

CONT

Les règles d'une grammaire affixe ressemblent à celles de grammaires non-contextuelles, dont les noms-de-notion (ou non-terminaux) seraient paramétrés. Ces paramètres appelés affixes permettent de doter ces notions de modalités. Leur nom s'inspire de la linguistique, où des modalités peuvent régir les affixes (préfixes, infixes ou suffixes).

Spanish

Campo(s) temático(s)
  • Programas y programación (Informática)
Save record 2

Record 3 2003-08-13

English

Subject field(s)
  • Computer Programs and Programming
CONT

In order for Bison to parse a language, it must be described by a context-free grammar. This means that you specify one or more syntactic groupings and give rules for constructing them from their parts. For example, in the C language, one kind of grouping is called an `expression’. One rule for making an expression might be, "An expression can be made of a minus sign and another expression". Another would be, "An expression can be an integer". As you can see, rules are often recursive, but there must be at least one rule which leads out of the recursion.

French

Domaine(s)
  • Programmes et programmation (Informatique)
OBS

rassemblement syntaxique : terme tiré d'un document traduit de l'anglais par le World Wide Web Consortium dont le rôle est d'établir des normes reliées aux technologies Internet.

Spanish

Save record 3

Record 4 1994-11-22

English

Subject field(s)
  • Artificial Intelligence
CONT

One advantage that a procedural encoding of the grammar... has over pattern-matching schemes in the implementation of fuzziness is its ability to control exactly where words can be ignored.... The amount of fuzziness-how many, if any, words in a row can be ignored-is controlled in two ways. First, whenever a grammar rule is invoked, the calling rule has the option of limiting the number of words that can be skipped. Second, each rule can decide which of its constituent pieces or words are required and how tightly controlled the search for them should be.... Fuzziness... reduce the size of the dictionary because all known noise words do not have to be included.

French

Domaine(s)
  • Intelligence artificielle
CONT

Le flou conceptuel.

Spanish

Save record 4

Record 5 1994-10-14

English

Subject field(s)
  • Farming Techniques
CONT

The term "global rule" is due to George Lakoff, and refers to a rule of grammar whose structural description refers not just to the input structure, but also to structures that are derivationally connected to the input structures.

OBS

A concept in generative grammar.

French

Domaine(s)
  • Techniques agricoles
CONT

De fait, les règles globales, ou du moins ce type particulier de règles globales, constituent un puissant mécanisme d'exception au principe du cycle.

Spanish

Save record 5

Record 6 1991-01-15

English

Subject field(s)
  • Artificial Intelligence
DEF

A transformational rule written on the assumption that the grammar describes the analysis of surface sentences.

French

Domaine(s)
  • Intelligence artificielle

Spanish

Save record 6

Record 7 1989-12-08

English

Subject field(s)
  • Artificial Intelligence
CONT

Gap symbols were added to the MG(metamorphosis grammar) rule by Pereria, resulting in extraposition grammar(XGs).

French

Domaine(s)
  • Intelligence artificielle
DEF

Grammaire de métamorphose augmentée de symboles discontinus, mais qui impose des contraintes sur la place et le contenu des symboles de discontinuité.

OBS

Grammaire de métamorphose augmentée de symboles discontinus. Rens. fourni par prof. Jean Vaucher, Université de Montréal.

Spanish

Save record 7

Record 8 1986-12-15

English

Subject field(s)
  • Artificial Intelligence
  • General Vocabulary
DEF

A rule indicating expansion of a term by replacing the term by further elements. Rewrite rules are typical, for example, of phrase structure rules in transformational-generative grammar.

French

Domaine(s)
  • Intelligence artificielle
  • Vocabulaire général
DEF

Règle qui spécifie une équivalence entre deux séquences de symboles.

CONT

Bien avant les débuts de l'intelligence artificielle, le formalisme des règles de production a été utilisé en logique symbolique par Post, puis dans les algorithmes de Markov et en linguistique par N. Chowsky sous forme de règles de récriture.

Spanish

Save record 8

Record 9 1986-11-26

English

Subject field(s)
  • Artificial Intelligence
CONT

Since Colmerauer's introduction of metamorphosis grammars(MGs), with their associated type O-like grammar rules, there has been a desire to allow more general rule formats in logic grammars.

French

Domaine(s)
  • Intelligence artificielle

Spanish

Save record 9

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2026
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Features

GCtranslate (available on the Government of Canada network only)

Use this artificial intelligence prototype to translate Government of Canada content up to and including Protected B. Available to employees of selected departments and agencies only.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: