class cnoun_as_noun_mod_name
{
    %% unsaturated N2 may post-modify other nouns to name them
    %% example: le département recherche est en déclin
    %% example: le département recherche et développement est en déclin
    %% example: la démarche essai-erreur est parfaite.
    %% we should have some kind of semantic restri
    %% question: is it equivalent to apposition ?
    %% (but we don't have commutation: * essai-erreur, la démarche, est
    %% parfaite)
    %% we should also try to block multiple adjoining of such names
    <: cnoun;
    desc.@kind0 = value(-);
    node(N2).bot.sat = value(-);
    - shallow_auxiliary;
    %    node(Foot).top = node(Root).bot;
    %    - Foot::full_agreement; Foot::N=Foot;
    node(Foot).top.headcat = value(nc);
    node(Root).top.headcat = value(nc);
    node(Foot).top.number = node(Root).bot.number;
    node(Foot).top.hum = node(Root).bot.hum;
    node(Foot).top.gender = node(Root).bot.gender;
    node(Foot).top.wh = node(Root).bot.wh;
    node(Foot).top.hum = node(Root).bot.hum;
    node(Foot).top.enum = node(Root).bot.enum;
    node(Root).cat = value(N);
    node(Root).adj = value(no);
    Root >> N2Root;
    Foot < N2Root;
    node(Root).cat = value(N);
    node(Monsieur).dummy.is_present = value(-);
    node(Root).top.enum = value(appos); %play similar role than appos
    node(N2).top.enum = value(~appos);
    node(N2).bot.enum = value(~appos);
    node(N2).adjleft = value(no);
    %% we may have some dash as noun separator not handled by sxpipe
    %% example: le débat université - grandes écoles
    node Dash: [type: lex, lex: '-'];
    Dash =>
        node(Root).top.depth = value(dash)
        ;
    ~ Dash =>
        node(Root).top.depth = value(~dash)
        ;
    Root >> Dash;
    Foot < Dash;
    Dash < N2Root;
    node(N).adjright = value(atmostone);
    node(N).adjleft = value(atmostone);
    node(N).adjwrap = value(no);
    node(Root).top.depth = value(a|b|dash);
    node(Foot).top.depth = value(-);
    node(N).bot.depth = value(-);
    node(N).top.depth = value(dash|b|-);
    node(Root).top.depth = value(b|dash);
    N +
        node(Root).top.depth = value(a),
        node(N).top.depth = value(b)
        |
        node(Root).top.depth = value(b|dash),
        node(N).top.depth = value(-|dash)
        ;
}