From fb88900245db01aec05a3e8eca5ac38f4b9ed09e Mon Sep 17 00:00:00 2001
From: "FERNANDO T.H.L" <130031227+UchihaIthachi@users.noreply.github.com>
Date: Fri, 3 May 2024 18:53:35 +0530
Subject: [PATCH] Update README.md

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 27c17c6..d8799ab 100644
--- a/README.md
+++ b/README.md
@@ -21,7 +21,7 @@
 
 ## Problem Requirements
 
-- Implement a lexical analyzer and a parser for the RPAL (Right-reference Pedagogic Algorithmic Language). Refer the [RPAL_Lex](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/doc/RPAL_Lex.pdf) for the lexical rules and [RPAL_Grammar](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/doc/RPAL_Grammar.pdf) for the grammar details.Additionally, refer to [About RPAL](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/doc/About%20RPAL.pdf) for information about the RPAL language.
+- Implement a lexical analyzer and a parser for the RPAL (Right-reference Pedagogic Algorithmic Language). Refer the [RPAL_Lex](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/doc/RPAL_Lex.pdf) for the lexical rules and [RPAL_Grammar](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/docs/Group%20116%20-%20PL%20Project%20Report%20.pdf) for information about the RPAL language.
 - The output of the parser should be the Abstract Syntax Tree (AST) for the given input program.
   Implement an algorithm to convert the Abstract Syntax Tree (AST) in to Standardize Tree (ST) and implement CSE machine.Refer to the [semantics](https://github.com/malinduGamage/RPAL-Interpreter/blob/main/doc/semantics.pdf) document, which contains the rules for transforming the AST into the ST
 - Program should be able to read an input file which contains a RPAL program and return Output which should match the output of rpal.exe for the relevant program.