Commit 25b4b57

authored

Supports L-Attributed

1 parent 50ab0fe commit 25b4b57Copy full SHA for 25b4b57

File tree

1 file changed

+27

-5

lines changed

ParserGenerator.cs

1 file changed

+27

-5

lines changed

`‎ParserGenerator.cs‎`

Lines changed: 27 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-/*`
	`1`	`+/*`
`2`	`2`
`3`	`3`	`Copyright (C) 2019. rollrat All Rights Reserved.`
`4`	`4`
`@@ -13,24 +13,41 @@`
`13`	`13`
`14`	`14`	`namespace ParserGenerator`
`15`	`15`	`{`
	`16`	`+ public class ParserAction`
	`17`	`+ {`
	`18`	`+ public Action<ParsingTree.ParsingTreeNode> SemanticAction;`
	`19`	`+ public static ParserAction Create(Action<ParsingTree.ParsingTreeNode> action)`
	`20`	`+ => new ParserAction { SemanticAction = action };`
	`21`	`+ }`
	`22`	`+`
`16`	`23`	`public class ParserProduction`
`17`	`24`	`{`
`18`	`25`	`public int index;`
`19`	`26`	`public string production_name;`
`20`	`27`	`public bool isterminal;`
`21`	`28`	`public List<ParserProduction> contents = new List<ParserProduction>();`
`22`	`29`	`public List<List<ParserProduction>> sub_productions = new List<List<ParserProduction>>();`
	`30`	`+ public List<ParserAction> temp_actions = new List<ParserAction>();`
	`31`	`+ public List<ParserAction> actions = new List<ParserAction>();`
`23`	`32`
`24`	`33`	`public static ParserProduction operator +(ParserProduction p1, ParserProduction p2)`
`25`	`34`	`{`
`26`	`35`	`p1.contents.Add(p2);`
`27`	`36`	`return p1;`
`28`	`37`	`}`
`29`	`38`
	`39`	`+ public static ParserProduction operator +(ParserProduction pp, ParserAction ac)`
	`40`	`+ {`
	`41`	`+ pp.temp_actions.Add(ac);`
	`42`	`+ return pp;`
	`43`	`+ }`
	`44`	`+`
`30`	`45`	`public static ParserProduction operator \|(ParserProduction p1, ParserProduction p2)`
`31`	`46`	`{`
`32`	`47`	`p2.contents.Insert(0, p2);`
`33`	`48`	`p1.sub_productions.Add(new List<ParserProduction>(p2.contents));`
	`49`	`+ p1.actions.AddRange(p2.temp_actions);`
	`50`	`+ p2.temp_actions.Clear();`
`34`	`51`	`p2.contents.Clear();`
`35`	`52`	`return p1;`
`36`	`53`	`}`
`@@ -1266,6 +1283,7 @@ public ShiftReduceParser CreateShiftReduceParserInstance()`
`1266`	`1283`	`var grammar = new List<List<int>>();`
`1267`	`1284`	`var grammar_group = new List<int>();`
`1268`	`1285`	`var production_mapping = new List<List<int>>();`
	`1286`	`+ var semantic_rules = new List<ParserAction>();`
`1269`	`1287`	`var pm_count = 0;`
`1270`	`1288`
`1271`	`1289`	`foreach (var pr in production_rules)`
`@@ -1280,6 +1298,7 @@ public ShiftReduceParser CreateShiftReduceParserInstance()`
`1280`	`1298`	`}`
`1281`	`1299`	`grammar.AddRange(ll);`
`1282`	`1300`	`production_mapping.Add(pm);`
	`1301`	`+ semantic_rules.AddRange(pr.actions);`
`1283`	`1302`	`}`
`1284`	`1303`
`1285`	`1304`	`for (int i = 0; i < number_of_states; i++)`
`@@ -1316,7 +1335,7 @@ public ShiftReduceParser CreateShiftReduceParserInstance()`
`1316`	`1335`	`}`
`1317`	`1336`	`}`
`1318`	`1337`
`1319`		`- return new ShiftReduceParser(symbol_table, jump_table, goto_table, grammar_group.ToArray(), grammar.Select(x => x.ToArray()).ToArray());`
	`1338`	`+ return new ShiftReduceParser(symbol_table, jump_table, goto_table, grammar_group.ToArray(), grammar.Select(x => x.ToArray()).ToArray(),semantic_rules);`
`1320`	`1339`	`}`
`1321`	`1340`	`}`
`1322`	`1341`
`@@ -1339,7 +1358,7 @@ public static ParsingTreeNode NewNode(string production, string contents)`
`1339`	`1358`	`=> new ParsingTreeNode { Parent = null, Childs = new List<ParsingTreeNode>(), Produnction = production, Contents = contents };`
`1340`	`1359`	`}`
`1341`	`1360`
`1342`		`- ParsingTreeNode root;`
	`1361`	`+ publicParsingTreeNode root;`
`1343`	`1362`
`1344`	`1363`	`public ParsingTree(ParsingTreeNode root)`
`1345`	`1364`	`{`
`@@ -1356,6 +1375,7 @@ public class ShiftReduceParser`
`1356`	`1375`	`List<string> symbol_index_name = new List<string>();`
`1357`	`1376`	`Stack<int> state_stack = new Stack<int>();`
`1358`	`1377`	`Stack<ParsingTree.ParsingTreeNode> treenode_stack = new Stack<ParsingTree.ParsingTreeNode>();`
	`1378`	`+ List<ParserAction> actions;`
`1359`	`1379`
`1360`	`1380`	`// 3 1 2 0`
`1361`	`1381`	`// Accept? Shift? Reduce? Error?`
`@@ -1364,13 +1384,14 @@ public class ShiftReduceParser`
`1364`	`1384`	`int[][] production;`
`1365`	`1385`	`int[] group_table;`
`1366`	`1386`
`1367`		`- public ShiftReduceParser(Dictionary<string, int> symbol_table, int[][] jump_table, int[][] goto_table, int[] group_table, int[][] production)`
	`1387`	`+ public ShiftReduceParser(Dictionary<string, int> symbol_table, int[][] jump_table, int[][] goto_table, int[] group_table, int[][] production,List<ParserAction>actions)`
`1368`	`1388`	`{`
`1369`	`1389`	`symbol_name_index = symbol_table;`
`1370`	`1390`	`this.jump_table = jump_table;`
`1371`	`1391`	`this.goto_table = goto_table;`
`1372`	`1392`	`this.production = production;`
`1373`	`1393`	`this.group_table = group_table;`
	`1394`	`+ this.actions = actions;`
`1374`	`1395`	`var l = symbol_table.ToList().Select(x => new Tuple<int, string>(x.Value, x.Key)).ToList();`
`1375`	`1396`	`l.Sort();`
`1376`	`1397`	`l.ForEach(x => symbol_index_name.Add(x.Item2));`
`@@ -1451,6 +1472,7 @@ private void reduce(int index)`
`1451`	`1472`	`reduction_parent.Contents = string.Join("", reduce_treenodes.Select(x => x.Contents));`
`1452`	`1473`	`reduction_parent.Childs = reduce_treenodes;`
`1453`	`1474`	`treenode_stack.Push(reduction_parent);`
	`1475`	`+ actions[reduction_parent.ProductionRuleIndex].SemanticAction(reduction_parent);`
`1454`	`1476`	`}`
`1455`	`1477`	`}`
`1456`		`-}`
	`1478`	`+}`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 25b4b57

File tree

1 file changed

1 file changed

`‎ParserGenerator.cs‎`

0 commit comments