-
Notifications
You must be signed in to change notification settings - Fork 10
/
EbnfAnalyzer.h
62 lines (51 loc) · 2.65 KB
/
EbnfAnalyzer.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#ifndef EBNFANALYZER_H
#define EBNFANALYZER_H
/*
* Copyright 2019 Rochus Keller <mailto:me@rochus-keller.ch>
*
* This file is part of the EbnfStudio application.
*
* The following is the license that applies to this copy of the
* application. For a license to use the application under conditions
* other than those described here, please email to me@rochus-keller.ch.
*
* GNU General Public License Usage
* This file may be used under the terms of the GNU General Public
* License (GPL) versions 2.0 or 3.0 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in
* the packaging of this file. Please review the following information
* to ensure GNU General Public Licensing requirements will be met:
* http://www.fsf.org/licensing/licenses/info/GPLv2.html and
* http://www.gnu.org/copyleft/gpl.html.
*/
#include "EbnfSyntax.h"
#include <QSet>
class FirstFollowSet;
class EbnfAnalyzer
{
public:
EbnfAnalyzer();
static QSet<QString> collectAllTerminalStrings( EbnfSyntax* );
static QStringList collectAllTerminalProductions( EbnfSyntax* );
typedef QList<Ast::NodeRefSet> LlkNodes;
static Ast::NodeRefSet intersectAll( const LlkNodes& lhs, const LlkNodes& rhs );
// NOTE: this is only an approximation
static void calcLlkFirstSet(quint16 k, LlkNodes&, const Ast::Node* node, FirstFollowSet* );
static void calcLlkFirstSet2(quint16 k, LlkNodes&, const Ast::Node* node, FirstFollowSet* );
static void calcLlkFirstTree(quint16 k, Ast::NodeTree*, const Ast::Node* node, FirstFollowSet* );
static void checkForAmbiguity( FirstFollowSet*, EbnfErrors*);
static void checkForAmbiguity( Ast::Node*, FirstFollowSet*, EbnfErrors*, bool recursive = true );
static Ast::ConstNodeList findPath( const Ast::Node* from, const Ast::Node* to );
protected:
static QSet<QString> collectAllTerminalStrings( Ast::Node* );
static void findAmbiguousAlternatives( Ast::Node*, FirstFollowSet*, EbnfErrors* );
static void findAmbiguousOptionals( Ast::Node*, FirstFollowSet*, EbnfErrors* );
static void reportAmbig(Ast::Node* seq, int ambigIdx, const Ast::NodeRefSet& diff, const Ast::NodeSet& ambigSet2, FirstFollowSet*, EbnfErrors* );
typedef QSet<const Ast::Node*> CheckSet;
static void calcLlkFirstSet2Imp(quint16 k, int curBin, int level, LlkNodes&, const Ast::Node* node,
FirstFollowSet*, CheckSet& visited );
static quint16 calcLlkFirstSetImp(quint16 k, quint16 curBin, LlkNodes&,
const Ast::Node* node, FirstFollowSet*, int level );
static bool findPath( Ast::ConstNodeList& path, const Ast::Node* to );
};
#endif // EBNFANALYZER_H