KULeuven-MAI/UAI.jl

Implement multi-node notation.

Open

#2 opened on Nov 29, 2019

View on GitHub
 (1 comment) (0 reactions) (0 assignees)Julia (1 fork)auto 404
good first issuehelp wanted

Repository metrics

Stars
 (2 stars)
PR merge metrics
 (PR metrics pending)

Description

The string below should result in a network where each C node has a directed connection to F. str1 = "C1,C2,C3>F" Same for the undirected case of course: str2 = "F-C1,C2,C3"

Both sides could be useful as well: str3 = "A,B-C,D" This could expand to this: str3 = "D-A-C; D-B-C"

The advantages of 'expanding' the syntactic sugar like that is that the parser only needs an extra preprocessing step (right behind the cleaning up of spaces). But if you see another better solution feel free to pick that one.

First writing some tests cases for this (e.g. the above) would be a good start.

Contributor guide

Research direction
Create a preprocessing function that expands multi node notations like 'C1,C2,C3>F' and 'F C1,C2,C3' into individual connections. Write test cases for the examples given, then integrate the preprocessing before the parser.
Tech stack
julia
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Half day
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
Julia
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
60