Marc Carrière
Marc Carrière (born 21 September 1964) is a politician in the Canadian province of Quebec, who was elected to represent the riding of Chapleau in the National Assembly of Quebec in the 2008 provincial election. He is a member of the Quebec Liberal Party.
Marc Carrière | |
|---|---|
| Member of the National Assembly of Quebec for Chapleau | |
| In office December 8, 2008 – August 29, 2018 | |
| Preceded by | Benoît Pelletier |
| Succeeded by | Mathieu Lévesque |
| Personal details | |
| Born | September 21, 1964 Gatineau, Quebec |
| Nationality | Canadian |
| Political party | Liberal |
| Alma mater | University of Ottawa |
Born in Gatineau, Quebec, Carrière obtained a bachelor's degree from the University of Ottawa. He was a member of the municipality of Val-des-Monts council from 1992 to 1996 and was mayor of the same municipality from 1996 until his election in 2008 in which he won without opposition in 2000 and 2005. He was a prefect for the Les Collines-de-l'Outaouais Regional County. He was also the president of the Conférence régionale des élus de l’Outaouais (CREO) from 2004 to 2008.
Electoral record
| 2008 Quebec general election: Chapleau | ||||||||
|---|---|---|---|---|---|---|---|---|
| Party | Candidate | Votes | % | ±% | ||||
| Liberal | Marc Carrière | 13,968 | 54.71 | |||||
| Parti Québécois | Yves Morin | 6,560 | 25.69 | |||||
| Action démocratique | Gilles Taillon | 3,194 | 12.51 | |||||
| Green | Roger Fleury | 1,032 | 4.04 | – | ||||
| Québec solidaire | Benoit Renaud | 609 | 2.39 | |||||
| Independent | Michel Soucy | 118 | 0.46 | |||||
| Marxist–Leninist | Pierre Soublière | 51 | 0.20 | |||||
| Total valid votes | 25,532 | 100.00 | ||||||
| Rejected and declined votes | 314 | |||||||
| Turnout | 25,846 | 47.96 | ||||||
| Electors on the lists | 53,892 | |||||||
| Source: Official Results, Government of Quebec | ||||||||
gollark: These are done → muahahaha.
gollark: ... also array literals, bee their bad docs.
gollark: Please also give me write access to the repo.
gollark: Oh, right, array indexing.
gollark: ```python# parsita-based pseudocode syntax parserfrom stmt import *from parsita import *from parsita.util import constantdef compose(f, g): return lambda x: f(g(x))def map_expr(x): start, end = x if end == "": return start return Op([start, end[1]], end[0])def map_unop_expr(x): return Op(x[1], x[0])def aliases(name, aliases): p = lit(name) for alias in aliases: p |= (lit(alias) > (lambda _: name)) return pclass ExprParser(TextParsers): ε = lit("") IntLit = reg("\-?[0-9]+") > compose(IntLit, int) StrLit = "'" >> reg("[^']*") << "'" > StrLit # TODO escapes (not in "spec" but could be needed) FloatLit = reg("\-?[0-9]+\.[0-9]+") > compose(FloatLit, float) Identifier = reg("[a-zA-Z_]+[a-zA-Z_0-9]*") > Var BracketedExpr = "(" >> Expr << ")" UnaryOperator = lit("NOT") Start = FloatLit | StrLit | IntLit | BracketedExpr | (UnaryOperator & Expr > map_unop_expr) | Identifier # avoid left recursion problems by not doing left recursion # AQA pseudocode does not appear to have a notion of "operator precedence", simplifying parsing logic nicely BinaryOperator = aliases("≤", ["<="]) | aliases("≠", ["!="]) | aliases("≥", [">="]) | lit("DIV") | lit("MOD") | lit("AND") | lit("OR") | reg("[+/*\-=<>]") End = (BinaryOperator & Expr) | ε Expr = (Start & End) > map_exprparse = ExprParser.Expr.parsex = parse("1+2+3 != 6 AND NOT 4 AND x + y")if isinstance(x, Failure): print(x.message)else: print(x.value)```
External links
- "Biography". Dictionnaire des parlementaires du Québec de 1792 à nos jours (in French). National Assembly of Quebec.
- Liberal Party biography (in French)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.