...........................
Answer:
250 I think
Step-by-step explanation:
Try 250
SORRY If I am wrong
Answer:

Step-by-step explanation:
we want to figure out the ellipse equation which passes through <u>(</u><u>1</u><u>,</u><u>4</u><u>)</u><u> </u>and <u>(</u><u>-</u><u>3</u><u>,</u><u>2</u><u>)</u>
the standard form of ellipse equation is given by:

where:
- (h,k) is the centre
- a is the horizontal redius
- b is the vertical radius
since the centre of the equation is not mentioned, we'd assume it (0,0) therefore our equation will be:

substituting the value of x and y from the point (1,4),we'd acquire:

similarly using the point (-3,2), we'd obtain:

let 1/a² and 1/b² be q and p respectively and transform the equation:

solving the system of linear equation will yield:

substitute back:

divide both equation by 1 which yields:

substitute the value of a² and b² in the ellipse equation , thus:

simplify complex fraction:

and we're done!
(refer the attachment as well)
A LR parser is called a shift-reduce algorithm, because in most cases it either shifts the next lexeme of input onto the parse stack or reduces the handle that is on top of the stack.
<u>Explanation:</u>
A parser is that aspect of the compiler which practices a token string as input and with the sustenance of enduring grammar, transforms it into the identical parse tree. The LR parser is a non-recursive, shift-reduce, bottom-up parser. It utilizes a broad range of context-free grammar which gives it the most valuable syntax analysis procedure.
LR means that the data is examined left-to-right and that a rightmost source, in reverse, is assembled. LR parsers relish time and space extended in the size of the input. Practically all programming languages possess LR grammars.
Answer:
Their is the answer below ;)