Parassala (State Assembly constituency)

Parassala State assembly constituency (Malayalam: പാറശ്ശാല നിയമസഭാ നിയോജക മണ്ഡലം) is one of the 140 state legislative assembly constituencies at the state Kerala in southern India. It is also one of the 7 state legislative assembly constituencies included in the Thiruvananthapuram Lok Sabha constituency.[1] As of the 2016 assembly elections, the current MLA is C. K. Hareendran of CPI(M).

136
Parassala
പാറശ്ശാല
Constituency for the Kerala Niyamasabha
Existence1957 - present
ReservationGeneral
Electorate2,10,162 (2016)
Current MLAC. K. Hareendran
PartyCPI(M)
Political Front  LDF
Elected Year2016
DistrictThiruvananthapuram
Local Self Governed SegmentsAmboori, Aryancode, Kallikkad, Kollayil, Kunnathukal, Ottasekharamangalam, Parassala, Perumkadavila and Vellarada Panchayats in Neyyattinkara Taluk.

Members of Legislative Assembly

The following list contains all members of Kerala legislative assembly who have represented the constituency:[2]

Key

  INC    CPI (M)    INC(I)    Independent  

Election Niyama

Sabha

 Member Party Tenure
1957 1st M. Kunjukrishnan Nadar INC 1957 – 1960
1960 2nd IND 1960 – 1965
1967 3rd N. Gamaliel INC 1967 – 1970
1970 4th M. Sathyaneshan CPI(M) 1970 – 1977
1977 5th M. Kunjukrishnan Nadar INC 1977 – 1979
1979* 5th M. Sathyaneshan CPI(M) 1979 – 1980
1980 6th N Sundaran Nadar INC(I) 1980 – 1982
1982 7th INC 1982 – 1984
1987 8th M. Sathyaneshan CPI(M) 1987 – 1991
1991 9th M. R. Raghu Chandra Bal INC 1991 – 1996
1996 10th N Sundaran Nadar IND 1996 – 2001
2001 11th INC 2001 – 2006
2006 12th R. Selvaraj CPI(M) 2006 – 2011
2011 13th A. T. George INC 2011 – 2016
2016 14th C. K. Hareendran CPI(M) Incumbent

* indicates bypolls

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)```
gollark: <@332271551481118732> Expression parsing is done, I think.
gollark: I wonder if AQA pseudocode *does* have operator precedence. We may need to harvest exam papers.
gollark: This will allow 3% more efficient harnessing of character set anomalies.
gollark: The parser supports anomalous unicode, muahaha.

See also

References
  1. "State Assembly Constituencies in Thiruvananthapuram district". trivandrum.nic.in. Retrieved 16 March 2020.
  2. "Parassala Assembly Election Results 2016, Winning MLA List, Constituency Map". www.mapsofindia.com. Retrieved 3 June 2020.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.